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.

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

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

Tanya Khovanova and Gregory Marton, Archive Labeling Sequences, Amer. Math. Monthly 132(8) (2025) 780-787. See p. 784. See also 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

Adjacent sequences: A130429 A130430 A130431 * A130433 A130434 A130435

Keyword

base,fini,nonn,full,changed

Author

Graeme McRae, May 26 2007

Status

approved