The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A082052 Sum of divisors of n that are not of the form 4k+1. 4
 0, 2, 3, 6, 0, 11, 7, 14, 3, 12, 11, 27, 0, 23, 18, 30, 0, 29, 19, 36, 10, 35, 23, 59, 0, 28, 30, 55, 0, 66, 31, 62, 14, 36, 42, 81, 0, 59, 42, 84, 0, 74, 43, 83, 18, 71, 47, 123, 7, 62, 54, 84, 0, 110, 66, 119, 22, 60, 59, 162, 0, 95, 73, 126, 0, 110, 67, 108, 26, 138, 71 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(A004613(n))=0. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..10000 FORMULA G.f.: Sum_{k>=1} x^(2*k)*(2 + 3*x^k + 4*x^(2*k) + 2*x^(4*k) + x^(5*k))/(1 - x^(4*k))^2. - Ilya Gutkovskiy, Sep 12 2019 MATHEMATICA sd[n_]:= Total[Select[Divisors[n], !IntegerQ[(# - 1) / 4]&]]; Array[sd, 100] (* Vincenzo Librandi, May 17 2013 *) Table[DivisorSum[n, #&, (!IntegerQ[(#-1)/4]&)], {n, 80}] (* Harvey P. Dale, Nov 30 2019 *) PROG (PARI) for(n=1, 100, print1(sumdiv(n, d, if(d%4!=1, d))", ")) CROSSREFS Cf. A000203, A050449, A050452, A050460, A078181, A078182, A082053. Sequence in context: A134972 A078890 A021813 * A232930 A217100 A241293 Adjacent sequences:  A082049 A082050 A082051 * A082053 A082054 A082055 KEYWORD nonn,easy AUTHOR Ralf Stephan, Apr 02 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 10:48 EDT 2021. Contains 347714 sequences. (Running on oeis4.)