Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072200
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072200 a(n)-th factorial is the smallest factorial containing exactly n 6's, or 0 if no such number exists. +0
9
3, 15, 23, 26, 32, 41, 35, 45, 50, 72, 63, 83, 84, 98, 89, 94, 91, 121, 99, 142, 117, 160, 129, 0, 127, 131, 132, 154, 153, 163, 170, 179, 190, 178, 166, 189, 217, 209, 206, 174, 208, 199, 207, 211, 214, 245, 263, 175, 240, 255, 295, 234, 213, 296, 286, 266, 278 (list; graph; listen)
OFFSET

1,1

COMMENT

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

EXAMPLE

a(2)=15 since 15-th factorial i.e. 15!=1307674368000 contains exactly two 6's.

MATHEMATICA

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

CROSSREFS

Cf. A072240, A072220, A072208, A072204, A072199, A072178, A072177, A072163 & A072124.

Sequence in context: A083795 A083793 A083934 this_sequence A106403 A060649 A009210

Adjacent sequences: A072197 A072198 A072199 this_sequence A072201 A072202 A072203

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