login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A165995
a(n) = Sum_{p > n} floor(n^2/p), for primes p.
1
0, 1, 2, 7, 9, 16, 19, 28, 40, 54, 60, 76, 81, 100, 121, 143, 151, 177, 184, 210, 241, 272, 281, 314, 349, 386, 424, 465, 480, 522, 538, 582, 628, 677, 728, 782, 800, 856, 910, 970, 991, 1051, 1072, 1133, 1198, 1263, 1285, 1353, 1424, 1497, 1571
OFFSET
1,3
COMMENTS
Also the number of integers between n and n^2 with a prime factor > n. - Orson R. L. Peters, Dec 04 2017
LINKS
MATHEMATICA
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 *)
CROSSREFS
Cf. A165974.
Sequence in context: A225675 A185869 A020894 * A287575 A267212 A022113
KEYWORD
nonn
AUTHOR
EXTENSIONS
Definition corrected by Orson R. L. Peters, Dec 04 2017
STATUS
approved