



1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 5, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 6, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Removing all the 1's results in the original sequence with every term incremented by 1.


LINKS

Table of n, a(n) for n=1..105.


FORMULA

Records are given by A055588(n): a(A055588(n))=n, where A055588(n)=Fibonacci(2n2)+1 and Fibonacci(n)=A000045(n).


EXAMPLE

Initialize all terms to 1. Set a(1)=1, go one term forward,
set a(2)=a(1)+1=2, go 2 terms forward,
set a(4)=a(2)+1=3, go 3 terms forward,
set a(7)=a(3)+1=2, go 2 terms forward,
set a(9)=a(4)+1=4, go 4 terms forward,
set a(13)=a(5)+1=1, etc.
The indices 1,2,4,7,9,13,... form A087158.


CROSSREFS

Cf. A087158, A085246.
Sequence in context: A058564 A226006 A210943 * A138618 A140583 A237266
Adjacent sequences: A087154 A087155 A087156 * A087158 A087159 A087160


KEYWORD

nonn


AUTHOR

Paul D. Hanna, Aug 22 2003


STATUS

approved



