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!)
A050454 a(n) = Sum_{d|n, d=3 mod 4} d^3. 2

%I #12 Dec 06 2018 07:50:01

%S 0,0,27,0,0,27,343,0,27,0,1331,27,0,343,3402,0,0,27,6859,0,370,1331,

%T 12167,27,0,0,19710,343,0,3402,29791,0,1358,0,43218,27,0,6859,59346,0,

%U 0,370,79507,1331,3402,12167,103823,27,343,0,132678,0,0

%N a(n) = Sum_{d|n, d=3 mod 4} d^3.

%H Seiichi Manyama, <a href="/A050454/b050454.txt">Table of n, a(n) for n = 1..10000</a>

%p 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:

%p seq(A050454(n),n=1..100) ; # _R. J. Mathar_, Jan 07 2011

%t a[n_] := DivisorSum[n, #^3 &, Mod[#, 4]==3 &]; Array[a, 30] (* _Amiram Eldar_, Dec 06 2018 *)

%K nonn

%O 1,3

%A _N. J. A. Sloane_, Dec 23 1999

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 July 14 19:54 EDT 2024. Contains 374323 sequences. (Running on oeis4.)