|
Search: id:A061014
|
|
|
| A061014 |
|
a(n) is the smallest number k such that k! contains k exactly n times. |
|
+0
1
|
|
| 0, 1, 37, 313, 80, 99, 586, 743, 5972, 9253, 8736, 9789
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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 this_sequence A130450 A068785 A133554
Adjacent sequences: A061011 A061012 A061013 this_sequence A061015 A061016 A061017
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Michel ten Voorde (seqfan(AT)tenvoorde.org) May 22 2001
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 09 2002
|
|
|
Search completed in 0.002 seconds
|
