

A080745


Inverse Aronson transform of Fibonacci numbers 1,2,3,5,8,13,...


0



1, 2, 3, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 90, 91
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

The Fibonacci numbers (A000045) are F_0 = 0, F_1 = 1, F_2 = 1, F_3 = 2, F_4 = 3, ...


LINKS

Table of n, a(n) for n=1..71.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)


FORMULA

kth 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.


CROSSREFS

Sequence in context: A114585 A161641 A053754 * A283776 A047476 A037462
Adjacent sequences: A080742 A080743 A080744 * A080746 A080747 A080748


KEYWORD

nonn,easy


AUTHOR

N. J. A. Sloane, Mar 10 2003


EXTENSIONS

More terms from Matthew Vandermast, Mar 16 2003


STATUS

approved



