Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037048
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A037048
%S A037048 0,3,9,20,33,54,77,108,142,186,228,285,342,409,481,563,644,742,837,946,
%T A037048 1060,1184,1308,1449,1592,1744,1903,2076,2240,2432,2618,2818,3028,3246,
%U A037048 3461,3702,3940,4192,4444,4719,4980,5274,5559
%N A037048 Number of pairs {i,j}, i>1, j>1, such that ij < n^2.
%F A037048 Sum(floor((n^2-1)/i)+1-i, i=2..n)
%e A037048 f(3)=3 because the only pairs of 2 numbers > 1 that are < 9 are (2,2) 
               (2,3) (2,4).
%Y A037048 Cf. A034806, A037092.
%Y A037048 Sequence in context: A164283 A033315 A073716 this_sequence A139142 A037257 
               A145068
%Y A037048 Adjacent sequences: A037045 A037046 A037047 this_sequence A037049 A037050 
               A037051
%K A037048 nonn
%O A037048 2,2
%A A037048 Joe K. Crump (joecr(AT)carolina.rr.com)

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research