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.

This page as a plain text file.
%I A061014 #18 Jun 02 2025 05:00:07
%S A061014 0,1,37,313,80,99,586,743,5972,9253,8736,9789
%N A061014 a(n) is the smallest number k such that k! contains k exactly n times.
%C A061014 Any further terms have k > 52000. - _Sean A. Irvine_, Jan 16 2023
%e A061014 a(3)=313 because in 313! 313 appears exactly 3 times.
%t A061014 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
%Y A061014 Cf. A067109.
%K A061014 nonn,base,more,less
%O A061014 0,3
%A A061014 _Michel ten Voorde_, May 22 2001
%E A061014 More terms from _Robert G. Wilson v_, Jan 09 2002