login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072417 a(n) = smallest positive m such that m! contains exactly n 0's, or 0 if no such m exists. 1

%I #7 Mar 12 2015 23:01:49

%S 1,5,7,0,12,18,19,20,22,25,28,34,37,42,48,41,38,53,51,50,57,63,67,66,

%T 76,68,61,80,82,79,83,0,77,104,89,73,85,94,110,109,118,108,107,0,116,

%U 105,131,114,129,137,128,115,122,124,127,0,134,135,144,159,140

%N a(n) = smallest positive m such that m! contains exactly n 0's, or 0 if no such m exists.

%e a(1)=5: 5!=120, which has only 1 zero. Other numbers with only 1 zero are 6 and 9.

%e a(2)=7 since 7th factorial, i.e., 7!=5040 contains exactly two 0's.

%e a(3)=0 since no factorial contains just three zeros.

%Y Cf. A072419.

%K base,nonn

%O 0,2

%A _Shyam Sunder Gupta_, Jul 31 2002

%E Edited by _N. J. A. Sloane_, Sep 06 2008 at the suggestion of _R. J. Mathar_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)