login
A091316
a(1)=1, a(2)=2, then a(a(1)+a(2)+...+a(k))=a(k), fill in any undefined places with the rule a(n+1)=a(n)+1.
1
1, 2, 2, 3, 2, 3, 4, 3, 4, 2, 3, 4, 3, 4, 5, 6, 4, 5, 6, 3, 4, 5, 6, 4, 5, 2, 3, 4, 3, 4, 5, 6, 4, 5, 6, 3, 4, 5, 6, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 8, 3, 4, 5, 6, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 4, 5, 6, 7, 8, 5, 6, 2, 3, 4, 3, 4, 5, 6, 4, 5, 6
OFFSET
1,2
FORMULA
Is sum(k=1, n, a(k)) asymptotic to c*n*log(n)*log(log(n)) with c=0.6...?
EXAMPLE
a(a(1)+a(2))=a(2) therefore a(3)=a(2)=2. a(a(1)+a(2)+a(3))=a(3) therefore a(5)=2. So a(4) is undefined but from the rule a(4)=a(3)+1=3.
CROSSREFS
Cf. A091309.
Sequence in context: A244580 A131830 A147952 * A321862 A071825 A115727
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 20 2004
STATUS
approved