Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072177
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072177 a(n)-th factorial is the smallest factorial containing exactly n 3's, or 0 if no such number exists. +0
9
8, 15, 25, 36, 24, 49, 32, 54, 43, 69, 76, 89, 84, 113, 82, 105, 112, 92, 114, 106, 118, 107, 109, 151, 166, 143, 160, 149, 190, 152, 158, 172, 176, 0, 192, 181, 183, 177, 180, 202, 200, 193, 226, 238, 242, 223, 251, 227, 290, 261, 267, 292, 265, 300, 295, 285 (list; graph; listen)
OFFSET

1,1

COMMENT

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

EXAMPLE

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

MATHEMATICA

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

CROSSREFS

Cf. A072269, A072220, A072208, A072204, A072200, A072199, A072178, A072163 & A072124.

Sequence in context: A034114 A069826 A129076 this_sequence A031125 A132298 A123526

Adjacent sequences: A072174 A072175 A072176 this_sequence A072178 A072179 A072180

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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research