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

a(n) = Sum_{j>n} floor(n^2/j).
2

%I #14 May 11 2016 00:42:31

%S 0,2,7,17,31,52,76,108,146,191,242,301,364,437,518,605,700,804,914,

%T 1034,1160,1295,1438,1594,1751,1921,2098,2288,2483,2688,2898,3119,

%U 3350,3593,3845,4103,4369,4647,4937,5234,5540,5854,6178,6512,6859

%N a(n) = Sum_{j>n} floor(n^2/j).

%H G. C. Greubel, <a href="/A166381/b166381.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = Sum_{i=1..n} floor(n*(n-i)/i). - _Wesley Ivan Hurt_, Jan 30 2016

%p A166381 := proc(n)

%p add( floor(n^2/j),j=n+1..n^2) ;

%p end proc: # _R. J. Mathar_, Jul 21 2015

%t Table[Sum[Floor[n (n - i)/i], {i, n}], {n, 100}]

%Y Column sums of A166373.

%K nonn,easy

%O 1,2

%A _Christopher Hunt Gribble_, Oct 13 2009