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

A261166

List run lengths of digits different from '6', when all terms are concatenated. Lexicographically first such sequence of nonnegative numbers with no repeated terms.

1, 6, 0, 2, 3, 4, 5, 7, 66, 8, 9, 60, 10, 61, 11, 16, 12, 13, 26, 14, 15, 17, 36, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 62, 54, 55, 57, 46, 58, 59, 70, 71, 56, 72, 73, 74, 75, 77

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

OFFSET

1,2

COMMENTS

See A261161 - A261163 for comments and examples.

LINKS

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

E. Angelini, To reach the next "1", SeqFan list, August 10, 2015.

PROG

(PARI) A261166(n=99, d=6, a=1, p=0, u=[-1], r=u)={for(n=2, n, print1(a", "); p+=#digits(a)+!a; r=concat(r, r[#r]+a+1); while(#r>1&&r[1]<p, r=r[2..-1]); u=setunion(u, [a]); while(#u>1&&u[2]==u[1]+1, u=u[2..-1]); for(k=u[1]+1, 9e9, setsearch(u, k)&&next; if(r[1] >= p+#dk=if(k, digits(k), [0]), setsearch(Set(dk), d)&&next, for(i=1, #dk, (dk[i]==d)==!setsearch(r, p+i-1)&&next(2))); a=k; next(2)); error); a}

CROSSREFS

Cf. A261160 - A261165, A261167 - A261169.

Sequence in context: A274542 A351234 A327837 * A021170 A329093 A195406

Adjacent sequences: A261163 A261164 A261165 * A261167 A261168 A261169

KEYWORD

nonn,base

AUTHOR

Eric Angelini and M. F. Hasler, Aug 10 2015

STATUS

approved