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

A201882

Where the first run of length n occurs in maximally unpredictable sequences A007061, A038219.

1, 3, 8, 11, 27, 36, 84, 231, 349, 535, 1267, 2916, 4114, 14349, 27045, 35059, 89723, 234443, 408129, 799350, 1926026, 2170589, 4291892, 10758318, 21141201, 57927399, 122141530, 138265841

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

OFFSET

1,2

COMMENTS

A201881(a(n)) = n and A201881(m) < n for m < a(n).

Since every substring appears in A007061 (and A038219) this sequence is infinite. - N. J. A. Sloane, May 17 2019

LINKS

Table of n, a(n) for n=1..28.

Rémy Sigrist, C program

PROG

(Haskell)

a201882 = ((+ 1) . fromJust . (`elemIndex` a201881_list))