|
%I #13 Oct 02 2014 18:03:07
%S 1,3,2,3,2,2,2,4,3,1,2,2,2,3,2,2,3,3,2,5,2,1,2,2,2,2,2,4,3,4,3,1,1,2,
%T 2,1,2,3,2,2,1,2,2,2,2,5,3,1,2,2,2,1,2,4,2,2,3,3,2,2,3,1,2,4,1,2,3,1,
%U 2,3,3,4,2,2,3,5,1,2,2,1,1,3,3,1,2,2,2,4,2,2,5,1,1,2,3,1,1,5,2,4,1,3,3,3,1,1
%N Length of n-th run of evens or odds in A064413.
%C Also gives lengths of runs of zeros and ones in A195376.
%H Reinhard Zumkeller, <a href="/A064654/b064654.txt">Table of n, a(n) for n = 1..10000</a>
%H J. C. Lagarias, E. M. Rains and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.NT/0204011">The EKG sequence</a>, Exper. Math. 11 (2002), 437-446.
%H <a href="/index/Ed#EKG">Index entries for sequences related to EKG sequence</a>
%o (Haskell)
%o import Data.List (group)
%o a064654 n = a064654_list !! (n-1)
%o a064654_list = map length $ group a195376_list
%o -- _Reinhard Zumkeller_, Sep 17 2001
%Y Cf. A064413, A064655, A065656.
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_, Oct 09 2001
%E More terms from _Matthew Conroy_, Oct 16 2001
|
