login
A130432
For digit n from 1 to 9, a(n) = the number of numbers m such that m is equal to the number of n's in the decimal digits of all numbers <= m.
12
84, 14, 36, 48, 5, 72, 49, 344, 9
OFFSET
1,1
COMMENTS
Note: sequences A101639, A101640 and A101641 are defined so that they exclude 0, so they have 13, 35 and 47 elements, respectively. This sequence counts all the zeros, so elements 2,3,4 of this sequence are 14,36,48.
LINKS
Tanya Khovanova and Gregory Marton, Archive Labeling Sequences, arXiv:2305.10357 [math.HO], 2023. See p. 4.
EXAMPLE
a(3)=36 because there are 36 numbers m such that m is equal to the number of 3's in the decimal digits of all numbers <= m.
CROSSREFS
See A014778 for proof that these sequences are finite and also A101639, A101640, A101641, A130427, A130428, A130429, A130430, A130431 for the numbers themselves.
Sequence in context: A116307 A093676 A221416 * A317437 A304379 A317916
KEYWORD
base,fini,nonn,full
AUTHOR
Graeme McRae, May 26 2007
STATUS
approved