The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #12 Dec 14 2023 16:30:05
%S 1,3,3,43,7,32,23,643,17,207,251,3255,255,1568,107
%N a(n) is the smallest number k > 0 such that bigomega(k^n + 1) = n.
%C a(16) <= 206874667; a(17) = 4095; a(18) = 6272; a(21) = 1151.
%e a(5) = 7 is the smallest number of the set {k(i)} = {7, 14, 24, 26, 46, 51, ...} where k(i)^5 + 1 has exactly 5 prime factors counted with multiplicity.
%o (PARI) a(n) = my(k=1); while (bigomega(k^n+1) != n, k++); k;
%Y Cf. A001222, A219018, A242786, A280005, A281940, A362957.
%K nonn,more,hard
%O 1,2
%A _Daniel Suteu_, Dec 14 2023