OFFSET
1,1
COMMENTS
No more terms <= 10^8.
No more terms <= 2 * 10^38. - Charles R Greathouse IV, Aug 22 2011
All terms are odd. - Kausthub Gudipati, Aug 22 2011
LINKS
Florian Luca and Filip Najman, On the largest prime factor of x^2 - 1, Math. Comp. 80 (2011), 429-435.
FORMULA
a(n) = 2 * A141399(n) + 1. - Thomas Ordowski, Mar 29 2026
EXAMPLE
881^2-1 = 776160 = 2^5 * 3^2 * 5 * 7^2 * 11 (all primes <= 11 appear), so 881 is a term.
MATHEMATICA
Select[Range[1, 10^4], First@ # == 1 && If[Length@ # > 1, Union@ Differences@ # == {1}, True] &@ PrimePi@ Map[First, FactorInteger[#^2 - 1]] &] (* Michael De Vlieger, Jul 02 2016 *)
PROG
(PARI) isok(n) = my(f = factor(n^2-1)); #f~ == primepi(f[#f~, 1]); \\ Michel Marcus, Jul 02 2016
(Python)
from sympy import prime, primefactors
def is_ok(m):
pf = primefactors(m*m - 1)
return prime(len(pf)) == pf[-1]
print([ m for m in range(3, 1270000, 2) if is_ok(m)])
# Ken Clements, Jan 01 2026
(Python)
from itertools import islice
from heapq import heappop, heappush
from sympy import integer_nthroot, nextprime
def A194099_gen(): # generator of terms
h, hset = [(1, (1, ))], {1}
while True:
m, ps = heappop(h)
a, b = integer_nthroot(m+1, 2)
if b:
yield a
for p in ps:
mp = m*p
if mp not in hset:
heappush(h, (mp, ps))
hset.add(mp)
q = nextprime(max(ps, default=1))
mp = m*q
if mp not in hset:
heappush(h, (mp, (ps+(q, ))))
hset.add(mp)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Vladimir Shevelev, Aug 15 2011
EXTENSIONS
Dubious claim of finiteness removed by Max Alekseyev, Mar 29 2026
STATUS
approved
