Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130432
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
10
84, 14, 36, 48, 5, 72, 49, 344, 9 (list; graph; listen)
OFFSET

1,1

COMMENT

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.

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

Cf. A014778 for proof these sequences are finite, and also A101639, A101640, A101641, A130427, A130428, A130429, A130430, A130431 for the numbers themselves.

Adjacent sequences: A130429 A130430 A130431 this_sequence A130433 A130434 A130435

Sequence in context: A087532 A116307 A093676 this_sequence A066689 A008898 A033404

KEYWORD

base,fini,nonn,full

AUTHOR

Graeme McRae (g_m(AT)mcraefamily.com), May 26 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 6 12:54 EDT 2008. Contains 144667 sequences.


AT&T Labs Research