A061014 a(n) is the smallest number k such that k! contains k exactly n times.
0, 1, 37, 313, 80, 99, 586, 743, 5972, 9253, 8736, 9789
Offset: 0
Examples
a(3)=313 because in 313! 313 appears exactly 3 times.
Crossrefs
Cf. A067109.
Programs
-
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
Extensions
More terms from Robert G. Wilson v, Jan 09 2002
Comments