A258383 Run lengths of consecutive identical terms in A062234.

2, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1

Offset: 1

Author

Reinhard Zumkeller, May 31 2015

Keywords

• nonn

Comments

a(A258437(n)) = n and a(m) != n for m < A258437(n). [Because of recent changes that were made to A258437, this comment may now need to be changed. - N. J. A. Sloane, Oct 31 2024]

Examples

			See A258432.
		

Links

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

Crossrefs

Cf. A062234, A258432, A258437.

Programs

Haskell

import Data.List (group)
a258383 n = a258383_list !! (n-1)
a258383_list = map length $ group a062234_list

Mathematica

Map[Length, Most[Split[ListConvolve[{-1, 2}, Prime[Range[200]]]]]] (* Paolo Xausa, Oct 30 2024 *)