OFFSET
1,1
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..1468 (terms 1..913 from Stijn Cambie)
Thomas Bloom, Problem 727, Erdős Problems.
PROG
(SageMath) def isok(n): return (binomial(2*n, n)%(n+2)**2==0 and binomial(2*n, n)%(n+1)**2==0)
[n for n in range(1, 10000) if isok(n)]
(PARI) isok(k) = !(binomial(2*k, k) % ((k+1)^2*(k+2)^2)); \\ Michel Marcus, Oct 09 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Stijn Cambie, Oct 02 2025
STATUS
approved
