|
| |
|
|
A167519
|
|
Lexicographically first sequence which lists the positions of the zero digits in the sequence.
|
|
8
|
|
|
|
3, 10, 11, 12, 11000, 11111, 11112, 11113, 11114, 11115, 11116, 11117, 11118, 11119, 11121, 11122, 11123, 11124, 11125, 11126, 11127, 11128, 11129, 11131, 11132, 11133, 11134, 11135, 11136, 11137, 11138, 11139, 11141, 11142, 11143, 11144
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
The terms of the sequence give the positions of the digits '0' in the string formed by concatenation all the terms (written in base 10).
|
|
|
LINKS
|
Table of n, a(n) for n=1..36.
|
|
|
EXAMPLE
|
The sequence cannot start with 1 (which would mean it starts with 0) or 2 (which would mean that the second term equals 0), so a(1)=3 is the smallest possibility.
Thereafter, the smallest possible value for a(2), which must have '0' as second digit, is a(2)=10.
This means that the next digit '0' must occur at position 10; up to there, we use the smallest possible values for a(3)=11 and a(4)=12.
Then must follow two nonzero digits (which must be part of a(5)) and then three zero digits (from a(2),a(3),a(4) = 10, 11, 12). None of the latter can be the first digit of a(6)), so they must be part of a(5), for which the smallest possibility is therefore a(5)=11000.
This also means that there is no digit '0' between the 12-th digit (= the last digit of a(6)), and the 11000-th digit of the sequence. So there follow roughly 11000/5 terms which are the smallest possible 5-digit terms without a zero digit.
|
|
|
CROSSREFS
|
Cf. A167500-A167503
Sequence in context: A106596 A024575 A114134 * A169939 A073108 A078306
Adjacent sequences: A167516 A167517 A167518 * A167520 A167521 A167522
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
M. F. Hasler (www.univ-ag.fr/~mhasler), Nov 05 2009
|
|
|
EXTENSIONS
|
Edited by Charles R Greathouse IV, Apr 24 2010
|
|
|
STATUS
|
approved
|
| |
|
|
