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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A226390 First differences of A014011. 4
 1, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(A227388(n)) = n and a(m) < n for m < A227388(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (Haskell) a226390 n = a226390_list !! (n-1) a226390_list = zipWith (-) (tail a014011_list) a014011_list CROSSREFS Cf. A014011, A227389 (run lengths). Sequence in context: A078767 A331137 A093125 * A156081 A147954 A105047 Adjacent sequences: A226387 A226388 A226389 * A226391 A226392 A226393 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jul 10 2013 STATUS approved

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.

Last modified December 8 13:46 EST 2023. Contains 367679 sequences. (Running on oeis4.)