login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = length of n-th run of identical symbols in A026498.
1

%I #9 Oct 03 2019 21:12:58

%S 3,1,7,1,1,3,3,1,8,1,6,1,7,1,1,3,3,1,1,7,1,3,3,1,7,1,1,3,3,1,8,1,6,1,

%T 8,1,3,3,1,1,7,1,6,1,7,1,1,3,3,1,8,1,6,1,7,1,1,3,3,1,1,7,1,3,3,1,7,1,

%U 1,3,3,1,1,7,1,6,1,8,1,3,3,1,1,7,1,3,3,1,7,1,1,3,3,1,8

%N a(n) = length of n-th run of identical symbols in A026498.

%H Michael De Vlieger, <a href="/A026499/b026499.txt">Table of n, a(n) for n = 1..10000</a>

%t Length /@ Split@ Array[1 + Mod[DigitCount[3 # + 1, 2, 1], 2] &, 300, 0] (* _Michael De Vlieger_, Oct 03 2019 *)

%K nonn

%O 1,1

%A _Clark Kimberling_

%E Corrected and extended by _Sean A. Irvine_, Oct 03 2019