A250007 Run lengths in A100618.

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

Offset: 1

Author

Reinhard Zumkeller, Jan 14 2015

Keywords

• nonn

Links

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

Crossrefs

Cf. A100618, A056526, A000960.

Programs

Haskell

import Data.List (group)
a250007 n = a250007_list !! (n-1)
a250007_list = map length $ group $ map a100618 [1..]