OFFSET
1,6
COMMENTS
a(n) = 0 if and only if n = 1 or n is prime. - Chai Wah Wu, Jul 26 2024
PROG
(PARI) a(n) = sum(x=1, n, sum(y=1, n, sum(z=1, n, sum(w=1, n, (gcd([x, y, z, w])==1)*(x*y+y*z+z*w+w*x==n)))));
(Python)
from math import gcd
from sympy import divisors
def A374970(n): return sum(1 for d in divisors(n, generator=True) for x in range(1, d) for y in range(1, n//d) if gcd(x, y, d-x, n//d-y)==1) # Chai Wah Wu, Jul 26 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jul 26 2024
STATUS
approved