login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%I #7 Mar 30 2012 18:39:22

%S 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,

%T 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,

%U 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

%N 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.

%F Is sum(k=1, n, a(k)) asymptotic to c*n*log(n)*log(log(n)) with c=0.6...?

%e 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.

%Y Cf. A091309.

%K nonn

%O 1,2

%A _Benoit Cloitre_, Feb 20 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)