OFFSET
1,5
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000
FORMULA
From Peter Bala, Dec 11 2020: (Start)
O.g.f.: Sum_{k >= 1} ( (6*k)*x^(6*k)/(1 - x^(6*k)) + (6*k-1)*x^(6*k-1)/(1 - x^(6*k-1)) + (6*k-5)*x^(6*k-5)/(1 - x^(6*k-5)) ).
Define a(n) = 0 for n < 1. Then a(n) = e(n) + a(n-1) + a(n-5) - a(n-8) - a(n-16) + + - -, where [1, 5, 8, 16, ...] is the sequence of generalized octagonal numbers A001082, and e(n) = (-1)^(m+1)*n if n is a generalized octagonal number of the form m*(3*m+-2); otherwise e(n) = 0. Examples of this recurrence are given below. (End)
Sum_{k=1..n} a(k) ~ c * n^2, where c = Pi^2/24 = A222171 = 0.411233... . - Amiram Eldar, Apr 12 2024
EXAMPLE
From Peter Bala, Dec 11 2020: (Start)
n = 20: n is not of the form m*(3*m +- 2), so e(n) = 0 and a(20) = a(19) + a(15) - a(12) - a(4) = 20 + 6 - 19 - 1 = 6;
n = 21: n = m*(3*m - 2) for m = 3, so e(n) = 21 and a(21) = 21 + a(20) + a(16) - a(13) - a(5) = 21 + 6 + 1 - 14 - 6 = 8;
n = 40: n = m*(3*m - 2) for m = 4, so e(n) = -40 and a(4) = -40 + a(39) + a(35) - a(32) - a(24) + a(19) + a(7) = -40 + 14 + 48 - 1 - 43 + 20 + 8 = 6. (End)
MATHEMATICA
Table[Sum[If[Mod[d, 6] <2 || Mod[d, 6]==5, d, 0], {d, Divisors[n]}], {n, 80}] (* Indranil Ghosh, Mar 25 2017 *)
PROG
(PARI) a(n) = sumdiv(n, d, ((d + 1) % 6 < 3) * d); \\ Amiram Eldar, Apr 12 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Mar 25 2017
STATUS
approved