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

A295575
a(n) = Sum_{1 <= j <= n/2, gcd(j,n)=1} j^3.
3
0, 1, 1, 1, 9, 1, 36, 28, 73, 28, 225, 126, 441, 153, 416, 496, 1296, 469, 2025, 1100, 1710, 1225, 4356, 1800, 4959, 2556, 5581, 4410, 11025, 3872, 14400, 8128, 11090, 8128, 15822, 8910, 29241, 13041, 21996, 16400, 44100, 15426, 53361, 27830, 33716, 29161, 76176, 27936, 77652, 37828
OFFSET
1,5
COMMENTS
If p is an odd prime, a(p) = (n^2-1)^2/64. - Robert Israel, Dec 10 2017
LINKS
John D. Baum, A Number-Theoretic Sum, Mathematics Magazine 55.2 (1982): 111-113.
MAPLE
f:= n -> add(t^3, t = select(t->igcd(t, n)=1, [$1..n/2])) :
map(f, [$1..100]); # Robert Israel, Dec 10 2017
MATHEMATICA
f[n_] := Plus @@ (Select[Range[n/2], GCD[#, n] == 1 &]^3); Array[f, 50] (* Robert G. Wilson v, Dec 10 2017 *)
PROG
(PARI) a(n) = sum(j=1, n\2, (gcd(j, n)==1)*j^3); \\ Michel Marcus, Dec 10 2017
CROSSREFS
In the Baum (1982) paper, S_1, S_2, S_3, S_4 are A023896, A053818, A053819, A053820, and S'_1, S'_2, S'_3, S'_4 are A066840, A295574, A295575, A295576.
Sequence in context: A373792 A276634 A050312 * A107892 A283043 A283016
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 08 2017
STATUS
approved