|
|
A153818
|
|
a(n) = Sum_{k=1..n} floor(n^2/k^2).
|
|
9
|
|
|
1, 5, 12, 22, 35, 53, 72, 96, 123, 153, 184, 222, 260, 304, 351, 402, 453, 510, 568, 633, 697, 765, 839, 916, 994, 1077, 1164, 1252, 1342, 1443, 1535, 1641, 1747, 1856, 1969, 2083, 2200, 2321, 2447, 2579, 2705, 2844, 2979, 3123, 3269, 3417, 3570, 3726, 3881
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
How can Sum_{k=1..n} floor(n^2/k^2) be expressed as a function of Sum_{k=1..n} floor(n/k)? [Ctibor O. Zizka, Feb 14 2009]
|
|
LINKS
|
|
|
FORMULA
|
Asymptotic formula: a(n) = zeta(2)*n^2 + zeta(1/2)*n + O(n^(1/2)).
Conjecture: a(n) = zeta(2)*n^2 + zeta(1/2)*n + O(n^0.5/log(n)) (see link). (End)
|
|
EXAMPLE
|
a(4)=22 because floor(16/1) + floor(16/4) + floor(16/9) + floor(16,16) = 16 + 4 + 1 + 1 = 22. [Emeric Deutsch, Jan 13 2009]
|
|
MAPLE
|
a := proc (n) options operator, arrow: sum(floor(n^2/k^2), k = 1 .. n) end proc: seq(a(n), n = 1 .. 50); # Emeric Deutsch, Jan 13 2009
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|