|
%I #14 Dec 26 2017 18:25:32
%S 0,1,2,7,9,16,19,28,40,54,60,76,81,100,121,143,151,177,184,210,241,
%T 272,281,314,349,386,424,465,480,522,538,582,628,677,728,782,800,856,
%U 910,970,991,1051,1072,1133,1198,1263,1285,1353,1424,1497,1571
%N a(n) = Sum_{p > n} floor(n^2/p), for primes p.
%C Also the number of integers between n and n^2 with a prime factor > n. - _Orson R. L. Peters_, Dec 04 2017
%H C. H. Gribble, <a href="/A165995/b165995.txt">Table of j, a(j) for j=1..2236</a>.
%t Block[{nn = 51, s}, s = Array[FactorInteger[#][[All, 1]] &, nn^2]; Table[Count[s[[#]] & /@ Range[n, n^2], _?(AnyTrue[#, # > n &] &)], {n, nn}]] (* _Michael De Vlieger_, Dec 04 2017 *)
%Y Cf. A165974.
%K nonn
%O 1,3
%A _Christopher Hunt Gribble_, Oct 03 2009
%E Definition corrected by _Orson R. L. Peters_, Dec 04 2017
|
