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”).

A037048
Number of pairs {i,j}, i>1, j>1, such that ij < n^2.
3
0, 3, 9, 20, 33, 54, 77, 108, 142, 186, 228, 285, 342, 409, 481, 563, 644, 742, 837, 946, 1060, 1184, 1308, 1449, 1592, 1744, 1903, 2076, 2240, 2432, 2618, 2818, 3028, 3246, 3461, 3702, 3940, 4192, 4444, 4719, 4980, 5274, 5559
OFFSET
2,2
LINKS
FORMULA
Sum(floor((n^2-1)/i)+1-i, i=2..n)
EXAMPLE
f(3)=3 because the only pairs of 2 numbers > 1 that are < 9 are (2,2) (2,3) (2,4).
MATHEMATICA
Table[Sum[Floor[(n^2-1)/i]+1-i, {i, 2, n}], {n, 2, 45}] (* Harvey P. Dale, Oct 10 2011 *)
CROSSREFS
Sequence in context: A073716 A174866 A187409 * A348090 A139142 A225385
KEYWORD
nonn
AUTHOR
Joe K. Crump (joecr(AT)carolina.rr.com)
STATUS
approved