OFFSET
1,3
LINKS
Žiga Pirc, Table of n, a(n) for n = 1..10000
PROG
(PARI) select( {is_A395626(n)=fordiv(n+=!n, d, d*d>n&&break; issquare(n/d-d)&&return(1))}, [0..166])
(Python)
from itertools import count, islice
from sympy import divisors
from sympy.ntheory.primetest import is_square
def A395626_gen(startvalue=0): # generator of terms >= startvalue
for k in count(max(startvalue, 0)):
if k == 0:
yield k
else:
for d in divisors(k):
if d**2>k:
break
if is_square(k//d-d):
yield k
break
CROSSREFS
KEYWORD
nonn,easy,new
AUTHOR
M. F. Hasler, Jun 18 2026
STATUS
approved
