login
A356208
a(n) is the number of occurrences of n in A133388.
2
2, 3, 4, 4, 5, 7, 6, 8, 8, 9, 9, 10, 10, 12, 13, 12, 12, 15, 14, 17, 16, 16, 17, 18, 19, 18, 19, 20, 18, 24, 20, 22, 25, 22, 27, 26, 23, 25, 25, 29, 26, 30, 27, 31, 32, 32, 24, 33, 33, 34, 32, 32, 35, 37, 36, 37, 38, 32, 35, 44, 36, 41, 41, 40, 42, 45, 39, 43, 42
OFFSET
1,1
PROG
(Python)
from sympy.solvers.diophantine.diophantine import diop_DN
def A356208(n): return sum(1 for m in range(1, (n**2<<1)+1) if n==max((a for a, b in diop_DN(-1, m)), default=0)) # Chai Wah Wu, Sep 08 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Hugo Pfoertner, Sep 07 2022
STATUS
approved