|
%I #9 Jul 13 2013 12:04:19
%S 1,1,2,2,1,1,1,3,3,1,4,4,1,2,2,1,1,1,2,1,2,3,1,1,3,2,5,1,1,2,1,5,2,2,
%T 2,6,1,1,1,1,1,2,3,3,2,1,3,1,1,1,1,1,6,2,1,2,1,1,2,2,3,1,1,4,4,1,2,1,
%U 1,2,2,2,1,3,1,4,1,1,2,1,1,1,1,7,3,2
%N Run lengths in maximally unpredictable sequences A007061, A038219.
%C a(2*n-1) = length of n-th block of consecutive ones in A007061, or consecutive zeros in A038219;
%C a(2*n) = length of n-th block of consecutive twos in A007061, or consecutive ones in A038219;
%C a(A201882(n)) = n and a(m) < n for m < A201882(n).
%H Reinhard Zumkeller, <a href="/A201881/b201881.txt">Table of n, a(n) for n = 1..1000</a>
%e A007061: 1, 2, 1,1, 2,2, 1, 2, 1, 2,2,2, 1,1,1, 2, 1,1,1,1, 2,2,2,2, ..
%e A038219: 0, 1, 0,0, 1,1, 0, 1, 0, 1,1,1, 0,0,0, 1, 0,0,0,0, 1,1,1,1, ..
%e A201881: 1, 1, __2, __2, 1, 1, 1, ____3, ____3, 1, ______4, ______4, ...
%o (Haskell)
%o import Data.List (group)
%o a201881 n = a201881_list !! (n-1)
%o a201881_list = map length $ group a007061_list
%K nonn
%O 1,3
%A _Reinhard Zumkeller_, Dec 11 2011
|
