A071326 Sum of squares > 1 dividing n.
0, 0, 0, 4, 0, 0, 0, 4, 9, 0, 0, 4, 0, 0, 0, 20, 0, 9, 0, 4, 0, 0, 0, 4, 25, 0, 9, 4, 0, 0, 0, 20, 0, 0, 0, 49, 0, 0, 0, 4, 0, 0, 0, 4, 9, 0, 0, 20, 49, 25, 0, 4, 0, 9, 0, 4, 0, 0, 0, 4, 0, 0, 9, 84, 0, 0, 0, 4, 0, 0, 0, 49, 0, 0, 25, 4, 0, 0, 0, 20, 90, 0, 0, 4, 0, 0, 0, 4, 0, 9, 0, 4, 0, 0, 0, 20, 0, 49, 9, 129
Offset: 1
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 1..16384
Programs
-
Mathematica
Array[DivisorSum[#, # &, IntegerQ@ Sqrt@ # &] - 1 &, 100] (* Michael De Vlieger, Nov 17 2017 *) f[p_, e_] := (p^(2*(1+Floor[e/2]))-1)/(p^2-1); a[1] = 0; a[n_] := Times @@ f @@@ FactorInteger[n] - 1; Array[a, 100] (* Amiram Eldar, May 15 2025 *)
-
PARI
A071326(n) = sumdiv(n,d,(d>1)*issquare(d)*d); \\ Antti Karttunen, Nov 17 2017
Formula
a(n) = A035316(n)-1.
Sum_{d|n, d>1} A010052(d). - Antti Karttunen, Nov 17 2017
Extensions
More terms from Antti Karttunen, Nov 17 2017