%I #22 Oct 31 2024 01:27:25
%S 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,
%T 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,
%U 1,1,1,1,1,1,1,1,2,1,1,2,1,2,1,1,1,1
%N Run lengths of consecutive identical terms in A062234.
%C 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]
%H Reinhard Zumkeller, <a href="/A258383/b258383.txt">Table of n, a(n) for n = 1..10000</a>
%e See A258432.
%t Map[Length, Most[Split[ListConvolve[{-1, 2}, Prime[Range[200]]]]]] (* _Paolo Xausa_, Oct 30 2024 *)
%o (Haskell)
%o import Data.List (group)
%o a258383 n = a258383_list !! (n-1)
%o a258383_list = map length $ group a062234_list
%Y Cf. A062234, A258432, A258437.
%K nonn
%O 1,1
%A _Reinhard Zumkeller_, May 31 2015