OFFSET
1,2
COMMENTS
Conjecture: every prime appears infinitely often in this sequence.
PROG
(PARI) gpf(n) = if (n==1, 1, vecmax(factor(n)[, 1]));
a(n) = gpf(n + primepi(n)); \\ Michel Marcus, Feb 24 2023
CROSSREFS
KEYWORD
easy,nonn,less
AUTHOR
Jonathan Vos Post, Nov 22 2004
EXTENSIONS
Extended by Ray Chandler, Nov 27 2004
STATUS
approved