login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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. 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 16:53 EDT 2020. Contains 334828 sequences. (Running on oeis4.)