|
|
A364242
|
|
a(n) is the smallest positive integer such that a(n) and a(n)+2 are both products of n distinct prime factors.
|
|
0
|
|
|
3, 33, 663, 18445, 887313, 84946015, 3086525013, 557027507463, 31110090768183, 3404401335645583, 609352762511672905
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
a(2) = 33 = 3 * 11, a(2) + 2 = 35 = 5 * 7.
a(3) = 663 = 3 * 13 * 17, a(3) + 2 = 665 = 5 * 7 * 19.
|
|
PROG
|
(PARI) isok(k, n) = (omega(k)==n) && (omega(k+2)==n) && issquarefree(k) && issquarefree(k+2)
a(n) = my(k=1); while (!isok(k, n), k++); k; \\ Michel Marcus, Jul 16 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|