OFFSET
1,1
COMMENTS
Row 2 of A213990.
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000 (terms 1..210 from R. H. Hardin)
Michael S. Branicky, Python program
EXAMPLE
Some solutions for n=3:
..1..1....0..2....0..1....1..0....1..3....0..0....0..3....0..0....0..3
..0..0....1..0....1..0....0..0....0..0....0..0....0..0....0..1....1..0
PROG
(Python) # see linked program for a much faster version
from itertools import product
def a(n): return sum(all(k <= n for k in [a*a+b*c, a*b+b*d, c*a+d*c, c*b+d*d]) for a, b, c, d in product(range(n+1), repeat=4))
print([a(n) for n in range(1, 31)]) # Michael S. Branicky, Nov 24 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jun 30 2012
STATUS
approved