Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072220
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072220 a(n)-th factorial is the smallest factorial containing exactly n 9's, or 0 if no such number exists. +0
9
12, 11, 21, 29, 34, 46, 36, 59, 79, 75, 0, 70, 82, 90, 95, 97, 112, 89, 105, 96, 134, 130, 127, 165, 142, 149, 144, 145, 161, 163, 182, 189, 160, 178, 139, 180, 206, 192, 224, 214, 188, 215, 226, 207, 218, 267, 283, 261, 268, 262, 240, 280, 234, 285, 343, 277 (list; graph; listen)
OFFSET

1,1

COMMENT

It is conjectured that a(11)=0 since no factorial < 10000 contained just eleven nines.

EXAMPLE

a(2)=11 since 11-th factorial i.e. 11!=39916800 contains exactly two 9's.

MATHEMATICA

Do[k = 1; While[ Count[IntegerDigits[k! ], 9] != n, k++ ]; Print[k], {n, 1, 60}]

CROSSREFS

Cf. A072232, A072208, A072204, A072200, A072199, A072178, A072177, A072163 & A072124.

Adjacent sequences: A072217 A072218 A072219 this_sequence A072221 A072222 A072223

Sequence in context: A070560 A019330 A086045 this_sequence A038337 A125509 A097824

KEYWORD

base,nonn

AUTHOR

Shyam Sunder Gupta (guptass(AT)rediffmail.com), Jul 30 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 31 2002

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research