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.

A093896 Least positive k such that n^n divides k!.

This page as a plain text file.
%I A093896 #12 Nov 18 2018 00:58:59
%S A093896 1,4,9,10,25,15,49,28,39,45,121,28,169,91,65,66,289,78,361,85,133,231,
%T A093896 529,76,205,325,165,175,841,125,961,164,341,561,217,150,1369,703,481,
%U A093896 165,1681,259,1849,451,186,1035,2209,196,595,405,833,637,2809,327,561
%N A093896 Least positive k such that n^n divides k!.
%C A093896 a(p) = p^2, p is a prime. a(n) <= n^2.
%H A093896 Jon E. Schoenfield, <a href="/A093896/b093896.txt">Table of n, a(n) for n = 1..10000</a>
%t A093896 Do[k = 1; While[Mod[k!, n^n] > 0, k++ ]; Print[k], {n, 1, 30}] (* _Ryan Propper_, Jun 20 2005 *)
%Y A093896 Cf. A093897.
%K A093896 nonn
%O A093896 1,2
%A A093896 _Amarnath Murthy_, Apr 23 2004
%E A093896 22 more terms from _Ryan Propper_, Jun 20 2005
%E A093896 More terms from _Stefan Steinerberger_, Feb 12 2006
%E A093896 More terms from _Jon E. Schoenfield_, Jan 06 2009