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

A159465
Sums of odd numbers, omitting squares.
1
3, 8, 15, 26, 39, 54, 71, 90, 111, 134, 161, 190, 221, 254, 289, 326, 365, 406, 449, 494, 541, 592, 645, 700, 757, 816, 877, 940, 1005, 1072, 1141, 1212, 1285, 1360, 1437, 1516, 1599, 1684, 1771, 1860, 1951, 2044, 2139, 2236, 2335, 2436, 2539, 2644, 2751
OFFSET
1,1
COMMENTS
Partial sums of A088828.
LINKS
FORMULA
a(n) = (n+S)^2 - (4*S^3-S)/3 where S = ceiling(round(sqrt(2*n-1))/2).
a(n) = n^2 + 2*(n + Sum_{i=1..n} max(0, n - A014105(i))). - John Tyler Rascoe, Jul 04 2022
EXAMPLE
a(5) = 3 + 5 + 7 + 11 + 13 = 39.
MATHEMATICA
s = Select[Range[1, 200, 2], EvenQ[DivisorSigma[1, #] - 2 #] &]; Accumulate[s] (* Vladimir Joseph Stephan Orlovsky, Apr 15 2011 *)
PROG
(Magma) S:=[ n: n in [1..108 by 2] | IsEven(SumOfDivisors(n)-2*n) ]; [ n eq 1 select S[1] else Self(n-1)+S[n]: n in [1..#S] ]; // Klaus Brockhaus, Apr 15 2009
CROSSREFS
Sequence in context: A080181 A071399 A001208 * A071148 A172289 A172296
KEYWORD
nonn,easy
AUTHOR
Gerald Hillier, Apr 13 2009
EXTENSIONS
More terms from Klaus Brockhaus and R. J. Mathar, Apr 16 2009
Name and comment swapped by Michel Marcus, Mar 31 2020
STATUS
approved