cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A061014 a(n) is the smallest number k such that k! contains k exactly n times.

Original entry on oeis.org

0, 1, 37, 313, 80, 99, 586, 743, 5972, 9253, 8736, 9789
Offset: 0

Views

Author

Michel ten Voorde, May 22 2001

Keywords

Comments

Any further terms have k > 52000. - Sean A. Irvine, Jan 16 2023

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