The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050451 a(n) = Sum_{d|n, d=1 mod 4} d^3. 3
1, 1, 1, 1, 126, 1, 1, 1, 730, 126, 1, 1, 2198, 1, 126, 1, 4914, 730, 1, 126, 9262, 1, 1, 1, 15751, 2198, 730, 1, 24390, 126, 1, 1, 35938, 4914, 126, 730, 50654, 1, 2198, 126, 68922, 9262, 1, 1, 91980, 1, 1, 1, 117650, 15751, 4914, 2198, 148878 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
MAPLE
A050451 := proc(n) local a, d; a := 0 ; for d in numtheory[divisors](n) do if d mod 4 = 1 then a := a+d^3 ; end if; end do; a ; end proc:
seq(A050451(n), n=1..100) ; # R. J. Mathar, Jan 07 2011
MATHEMATICA
a[n_] := DivisorSum[n, #^3 &, Mod[#, 4]==1 &]; Array[a, 30] (* Amiram Eldar, Dec 06 2018 *)
CROSSREFS
Sequence in context: A318257 A110825 A365897 * A059024 A365896 A331401
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 10 10:32 EDT 2024. Contains 373264 sequences. (Running on oeis4.)