This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088936 a(1)=1, a(2)=2 then a(A(k))=a(k) where a(1),a(2),...,a(k) are k consecutive defined terms and A(k)=a(1)+a(2)+...+a(k). Fill in any undefined places with max{a(i)+1 : 1<=i<=k}. 4
 1, 2, 2, 3, 2, 4, 4, 3, 4, 2, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 3, 5, 5, 5, 4, 5, 2, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 4, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 4, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 3, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 4, 6, 6, 6, 6, 5, 6, 2, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(2+(1/2)*{sum(k=1, n, sum(i=0, k, i!)))=2 CROSSREFS Cf. A088937(partial sums), A088938 (occurrences of 2's), A088939, A088940. Sequence in context: A266470 A209700 A115980 * A328405 A049822 A140060 Adjacent sequences:  A088933 A088934 A088935 * A088937 A088938 A088939 KEYWORD nonn AUTHOR Benoit Cloitre and Claude Lenormand (claude.lenormand(AT)free.fr), Oct 25 2003 STATUS approved

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

Last modified December 11 07:35 EST 2019. Contains 329914 sequences. (Running on oeis4.)