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

A082051
Sum of divisors of n that are not of the form 3k+2.
4
1, 1, 4, 5, 1, 10, 8, 5, 13, 11, 1, 26, 14, 8, 19, 21, 1, 37, 20, 15, 32, 23, 1, 50, 26, 14, 40, 40, 1, 65, 32, 21, 37, 35, 8, 89, 38, 20, 56, 55, 1, 80, 44, 27, 73, 47, 1, 114, 57, 36, 55, 70, 1, 118, 56, 40, 80, 59, 1, 141, 62, 32, 104, 85, 14, 131, 68, 39, 73, 88, 1, 185
OFFSET
1,3
LINKS
FORMULA
a(A003627(n)) = 1.
G.f.: Sum_{k>=1} x^k*(1 + 3*x^(2*k) + 2*x^(3*k))/(1 - x^(3*k))^2. - Ilya Gutkovskiy, Sep 12 2019
Sum_{k=1..n} a(k) ~ c * n^2, where c = Pi^2/18 = 0.548311... (A086463). - Amiram Eldar, Jan 06 2024
MATHEMATICA
sd[n_]:= Total[Select[Divisors[n], !IntegerQ[(# - 2) / 3]&]]; Array[sd, 100] (* Vincenzo Librandi, May 17 2013 *)
PROG
(PARI) for(n=1, 100, print1(sumdiv(n, d, if(d%3!=2, d))", "))
(PARI)
N = 66; x = 'x + O('x^N);
gf = sum(n=1, N, (3*n-2)*x^(3*n-2)/(1-x^(3*n-2)) + (3*n)*x^(3*n)/(1-x^(3*n)) );
v = Vec(gf)
\\ Joerg Arndt, May 17 2013
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, Apr 02 2003
STATUS
approved