|
%I #24 Dec 30 2019 19:37:48
%S 4,9,16,18,25,27,32,50,54,64,75,81,96,98,100,108,125,128,135,147,150,
%T 160,162,175,189,192,196,200,216,225,243,245,250,256,270,294,300,324,
%U 343,350,375,378,392,400,405,432,441,450,486,490,500,512,525,540,567
%N Numbers n such that S(n)! > n^2 > P(n)!, where S(n)! is the smallest factorial divisible by n and P(n) is the greatest prime factor of n.
%C It is conjectured that n^2 < P(n)! for almost all n. It is known that S(n) = P(n) for almost all n. Clearly, S(n) >= P(n) for all n > 1.
%H David A. Corneth, <a href="/A122379/b122379.txt">Table of n, a(n) for n = 1..10000</a>
%H J. Sondow, <a href="https://www.jstor.org/stable/27642006">A geometric proof that e is irrational and a new measure of its irrationality</a>, Amer. Math. Monthly 113 (2006) 637-641.
%H J. Sondow, <a href="https://arxiv.org/abs/0704.1282">A geometric proof that e is irrational and a new measure of its irrationality</a>, arXiv:0704.1282 [math.HO], 2007-2010.
%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers.</a>
%e S(9)! = 6! = 720 > 81 = 9^2 > 6 = 3! = P(9)!, so 9 is a member.
%t s[n_] := For[k = 1, True, k++, If[Divisible[k!, n], Return[k]]];
%t p[n_] := FactorInteger[n][[-1, 1]];
%t okQ[n_] := s[n]! > n^2 > p[n]!;
%t Select[Range[1000], okQ] (* _Jean-François Alcover_, Jan 27 2019 *)
%Y Cf. A000290, A002034, A006530, A057109, A092495, A102068, A122378, A122380.
%K nonn
%O 1,1
%A _Jonathan Sondow_, Sep 03 2006
|
