OFFSET
1
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..65537
FORMULA
a(1) = 0; for n > 1, a(n) = A008966(n^2-1).
Sum_{k=1..n} a(k) ~ c*n, where c = Product_{p prime} (1 - 2/p^2) = 0.322634... (A065474). - Amiram Eldar, Jan 22 2025
MATHEMATICA
a[n_] := Boole[SquareFreeQ[n^2-1]]; Array[a, 100] (* Amiram Eldar, Jan 22 2025 *)
PROG
(PARI) A379971(n) = issquarefree(n^2-1);
(Python)
from sympy import factorint
def A379971(n): return 0 if n<=1 else int(max((a:=factorint(n-1)).values(), default=0)<=1 and max((b:=factorint(n+1)).values(), default=0)<=1 and not set(a)&set(b)) # Chai Wah Wu, Jan 22 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 22 2025
STATUS
approved