A026499 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A026499

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

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, 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, 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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Michael De Vlieger, Table of n, a(n) for n = 1..10000

MATHEMATICA

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

CROSSREFS

Sequence in context: A272030 A340878 A346182 * A339452 A242114 A143470

Adjacent sequences: A026496 A026497 A026498 * A026500 A026501 A026502

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Corrected and extended by Sean A. Irvine, Oct 03 2019

STATUS

approved