OFFSET
0,2
LINKS
Chai Wah Wu, Table of n, a(n) for n = 0..10000
FORMULA
For n > 0, a(n) = Sum_{i=n*(n-1)+1..n*(n+1)} A005875(i). - Chai Wah Wu, Jun 23 2024
PROG
(Python)
from itertools import combinations_with_replacement
from math import prod
from collections import Counter
def A016728(n):
if n == 0: return 1
x, y = (2*n-1)**2, (2*n+1)**2
return sum(6//prod((1, 1, 2, 6)[d] for d in q.values())<<3-q[0] for q in map(Counter, combinations_with_replacement(range(n+1), 3)) if x <= sum(b*a**2 for a, b in q.items())<<2 <= y) # Chai Wah Wu, Jun 20 2024
(Python)
# uses Python code from A005875
def A016728(n):
if n == 0: return 1
return sum(A005875(i) for i in range(n*(n-1)+1, n*(n+1)+1)) # Chai Wah Wu, Jun 23 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
csvcjld(AT)nomvst.lsumc.edu
STATUS
approved