login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072269 Smallest factorial containing exactly n 3's. 1
40320, 1307674368000, 15511210043330985984000000, 371993326789901217467999448150835200000000, 620448401733239439360000, 608281864034267560872252163321295376887552831379210240000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..6.

EXAMPLE

a(2)=1307674368000 so 1307674368000 is the smallest factorial containing exactly two 3's.

MATHEMATICA

With[{fctrls=Range[100]!}, Table[SelectFirst[fctrls, DigitCount[#, 10, 3] == n&], {n, 6}]] (* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, Jul 08 2015 *)

CROSSREFS

Sequence in context: A287084 A071550 A181724 * A259113 A195392 A172632

Adjacent sequences:  A072266 A072267 A072268 * A072270 A072271 A072272

KEYWORD

base,nonn

AUTHOR

Shyam Sunder Gupta, Jul 30 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 05:56 EST 2021. Contains 349470 sequences. (Running on oeis4.)