Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072208
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072208 a(n)-th factorial is the smallest factorial containing exactly n 8's, or 0 if no such number exists. +0
9
11, 9, 36, 16, 30, 27, 39, 33, 44, 58, 56, 64, 80, 70, 72, 94, 97, 71, 108, 143, 120, 134, 118, 162, 125, 133, 151, 137, 138, 159, 169, 197, 184, 171, 178, 176, 206, 177, 191, 208, 207, 240, 252, 232, 239, 270, 229, 308, 243, 223, 278, 257, 250, 0, 303, 242, 311 (list; graph; listen)
OFFSET

1,1

COMMENT

It is conjectured that a(54)=0 since no factorial < 10000 contained just 54 eights.

EXAMPLE

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

MATHEMATICA

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

CROSSREFS

Cf. A072237, A072220, A072204, A072200, A072199, A072178, A072177, A072163 & A072124.

Sequence in context: A038322 A090075 A004500 this_sequence A038323 A121154 A078200

Adjacent sequences: A072205 A072206 A072207 this_sequence A072209 A072210 A072211

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research