cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A368162 a(n) is the smallest number k > 0 such that bigomega(k^n + 1) = n.

This page as a plain text file.
%I A368162 #12 Dec 14 2023 16:30:05
%S A368162 1,3,3,43,7,32,23,643,17,207,251,3255,255,1568,107
%N A368162 a(n) is the smallest number k > 0 such that bigomega(k^n + 1) = n.
%C A368162 a(16) <= 206874667; a(17) = 4095; a(18) = 6272; a(21) = 1151.
%e A368162 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 A368162 (PARI) a(n) = my(k=1); while (bigomega(k^n+1) != n, k++); k;
%Y A368162 Cf. A001222, A219018, A242786, A280005, A281940, A362957.
%K A368162 nonn,more,hard
%O A368162 1,2
%A A368162 _Daniel Suteu_, Dec 14 2023