|
%I #9 Mar 30 2012 17:27:18
%S 1,2,3,8,9,10,11,12,14,15,16,17,18,19,20,34,35,36,37,38,39,40,41,42,
%T 43,44,45,46,47,48,49,50,51,52,53,54,56,57,58,59,60,61,62,63,64,65,66,
%U 67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,90,91
%N Inverse Aronson transform of Fibonacci numbers 1,2,3,5,8,13,...
%C The Fibonacci numbers (A000045) are F_0 = 0, F_1 = 1, F_2 = 1, F_3 = 2, F_4 = 3, ...
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a> (math.NT/0305308)
%F k-th segment (k>=1) consists of {F_{k+1}} if k is a Fibonacci number, otherwise {F_k+1, ..., F_{k+1}-1}; except that the 4th segment is empty.
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_, Mar 10 2003
%E More terms from _Matthew Vandermast_, Mar 16 2003
|
