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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061014 a(n) is the smallest number k such that k! contains k exactly n times. 0
0, 1, 37, 313, 80, 99, 586, 743, 5972, 9253, 8736, 9789 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..11.

EXAMPLE

a(3)=313 because in 313! 313 appears exactly 3 times.

MATHEMATICA

a = Table[ -1, {12}]; Do[b = Length[ StringPosition[ ToString[n! ], ToString[n]]]; If[a[[b+1]] == -1, a[[b+1]] = n]], {n, 0, 15000} ]; a

CROSSREFS

Cf. A067109.

Sequence in context: A165373 A165292 A114785 * A130450 A271184 A217117

Adjacent sequences:  A061011 A061012 A061013 * A061015 A061016 A061017

KEYWORD

nonn,base

AUTHOR

Michel ten Voorde May 22 2001

EXTENSIONS

More terms from Robert G. Wilson v, Jan 09 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 March 29 02:19 EDT 2020. Contains 333104 sequences. (Running on oeis4.)