login
This site is supported by donations to The OEIS Foundation.

 

Logo

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!)
A250007 Run lengths in A100618. 3
1, 1, 2, 1, 1, 2, 1, 3, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 1, 3, 2, 2, 1, 1, 2, 4, 1, 1, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 2, 3, 3, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 1, 7, 1, 1, 2, 1, 1, 2, 1, 3, 1, 1, 2, 2, 2, 4, 1, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

PROG

(Haskell)

import Data.List (group)

a250007 n = a250007_list !! (n-1)

a250007_list = map length $ group $ map a100618 [1..]

CROSSREFS

Cf. A100618, A056526, A000960.

Sequence in context: A228726 A165357 A210961 * A048996 A111786 A072811

Adjacent sequences:  A250004 A250005 A250006 * A250008 A250009 A250010

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jan 14 2015

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 December 12 09:36 EST 2019. Contains 329953 sequences. (Running on oeis4.)