Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072178
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072178 a(n)-th factorial is the smallest factorial containing exactly n 4's, or 0 if no such number exists. +0
9
4, 19, 21, 24, 44, 42, 50, 57, 0, 60, 76, 91, 56, 86, 85, 66, 92, 88, 114, 129, 131, 106, 130, 122, 117, 157, 134, 175, 119, 150, 181, 165, 185, 179, 198, 182, 220, 228, 188, 190, 261, 235, 222, 231, 229, 233, 224, 227, 288, 372, 241, 279, 254, 253, 318, 267 (list; graph; listen)
OFFSET

1,1

COMMENT

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

EXAMPLE

a(2)=19 since 19-th factorial i.e. 19!=121645100408832000 contains exactly two 4's.

MATHEMATICA

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

CROSSREFS

Cf. A072244, A072220, A072208, A072204, A072200, A072199, A072177, A072163 & A072124.

Sequence in context: A165820 A043056 A012879 this_sequence A116980 A022135 A028564

Adjacent sequences: A072175 A072176 A072177 this_sequence A072179 A072180 A072181

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research