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!)
 A050454 a(n) = Sum_{d|n, d=3 mod 4} d^3. 2
 0, 0, 27, 0, 0, 27, 343, 0, 27, 0, 1331, 27, 0, 343, 3402, 0, 0, 27, 6859, 0, 370, 1331, 12167, 27, 0, 0, 19710, 343, 0, 3402, 29791, 0, 1358, 0, 43218, 27, 0, 6859, 59346, 0, 0, 370, 79507, 1331, 3402, 12167, 103823, 27, 343, 0, 132678, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 MAPLE A050454 := proc(n) local a, d; a := 0 ; for d in numtheory[divisors](n) do if d mod 4 = 3 then a := a+d^3 ; end if; end do; a ; end proc: seq(A050454(n), n=1..100) ; # R. J. Mathar, Jan 07 2011 MATHEMATICA a[n_] := DivisorSum[n, #^3 &, Mod[#, 4]==3 &]; Array[a, 30] (* Amiram Eldar, Dec 06 2018 *) CROSSREFS Sequence in context: A145336 A271246 A005084 * A277042 A224118 A178737 Adjacent sequences:  A050451 A050452 A050453 * A050455 A050456 A050457 KEYWORD nonn AUTHOR N. J. A. Sloane, Dec 23 1999 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 October 27 15:27 EDT 2020. Contains 338035 sequences. (Running on oeis4.)