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

A179956
a(n) is the smallest integer that contains a(n-1) but does not begin with a(n-1).
0
1, 21, 121, 1121, 11121, 111121, 1111121, 11111121, 111111121, 1111111121, 11111111121, 111111111121, 1111111111121, 11111111111121, 111111111111121, 1111111111111121, 11111111111111121, 111111111111111121, 1111111111111111121, 11111111111111111121
OFFSET
1,2
FORMULA
For n > 2, a(n) = 10^(n-1) + a(n-1). - Jon Maiga, Aug 04 2019
EXAMPLE
The next term after 1 is 21, because 21 is the lowest integer higher than 1 that contains a 1 but does not start with 1.
MATHEMATICA
a[1] = 1
a[2] = 21
a[n_] := 10^(n - 1) + a[n - 1]
Array[a, 20] (* Jon Maiga, Aug 04 2019 *)
CROSSREFS
Sequence in context: A200888 A179441 A164785 * A117388 A053052 A243882
KEYWORD
easy,base,nonn
AUTHOR
Dominick Cancilla, Aug 03 2010
EXTENSIONS
Definition corrected and more terms added by Jon Maiga, Aug 04 2019
STATUS
approved