The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 2..1000 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 Cf. A034806, A037092. Sequence in context: A073716 A174866 A187409 * A139142 A225385 A037257 Adjacent sequences:  A037045 A037046 A037047 * A037049 A037050 A037051 KEYWORD nonn AUTHOR Joe K. Crump (joecr(AT)carolina.rr.com) STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 07:28 EDT 2021. Contains 347596 sequences. (Running on oeis4.)