OFFSET
1,1
COMMENTS
De Koninck and Moineau (2018) proved that this sequence is infinite assuming the Bunyakovsky conjecture.
REFERENCES
Jean-Marie De Koninck and Nicolas Doyon, The Life of Primes in 37 Episodes, American Mathematical Society, 2021, p. 232.
LINKS
Daniel Suteu, Table of n, a(n) for n = 1..9686 (terms <= 10^15)
Jean-Marie De Koninck and Matthieu Moineau, Consecutive Integers Divisible by a Power of their Largest Prime Factor, J. Integer Seq., Vol. 21 (2018), Article 18.9.3.
Eric Weisstein's World of Mathematics, Bouniakowsky Conjecture.
Wikipedia, Bunyakovsky conjecture.
EXAMPLE
8 = 2^3 is a term since P(8) = 2 and 2^3 | 8, 9 = 3^2, P(9) = 3, and 3^2 | 9.
MATHEMATICA
p[n_] := FactorInteger[n][[-1, 2]]; Select[Range[10^6], p[#] > 2 && p[# + 1] > 1 &]
PROG
(Python)
from sympy import factorint
def c(n, e): f = factorint(n); return f[max(f)] >= e
def ok(n): return n > 1 and c(n, 3) and c(n+1, 2)
print([k for k in range(10**6) if ok(k)]) # Michael S. Branicky, May 30 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, May 30 2022
STATUS
approved