login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A365326
a(n) is the smallest positive number k such that k^2 - 1 and k^2 + 1 each have exactly n distinct prime divisors.
0
2, 5, 13, 83, 463, 4217, 169333, 2273237, 23239523, 512974197, 5572561567
OFFSET
1,1
FORMULA
a(n) >= max(A219017(n), A180278(n)). - Daniel Suteu, Sep 03 2023
PROG
(PARI) isok(k, n) = (omega(k^2-1)==n) && (omega(k^2+1)==n);
a(n) = my(k=2); while (!isok(k, n), k++); k; \\ Michel Marcus, Sep 03 2023
CROSSREFS
Cf. A088075 (with k instead of k^2).
Sequence in context: A349735 A081650 A092262 * A096280 A236395 A032015
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(9)-a(11) from Amiram Eldar, Sep 03 2023
STATUS
approved