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.
%I A358656 #51 May 19 2024 04:10:22
%S A358656 3,2,7,71,241,83,157,6947,4231,35509,15541,199499,649147
%N A358656 Least prime p such that p^n + 2 is the product of n distinct primes.
%C A358656 Corresponding values of p^n + 2 are 5, 6, 345, 25411683, 812990017203, 326940373371, 2351243277537495, ...
%e A358656 a(1) = 3; 3^1 + 2 = 5.
%e A358656 a(2) = 2; 2^2 + 2 = 2 * 3.
%e A358656 a(3) = 7; 7^3 + 2 = 3 * 5 * 23.
%e A358656 a(4) = 71; 71^4 + 2 = 3 * 11 * 19 * 40529.
%t A358656 Table[b=2;y[a_]:=FactorInteger[Prime[a]^n+b];k=1;Monitor[Parallelize[While[True,If[And[Length[y[k]]==n,Count[Flatten[y[k]],1]==n],Break[]];k++];k],k]//Prime,{n,1,10}]
%o A358656 (PARI) a(n) = forprime(p=2, , my(f=factor(p^n + 2)); if (issquarefree(f) && (omega(f) == n), return(p))); \\ _Michel Marcus_, Nov 29 2022
%Y A358656 Cf. A280005, A000961, A005117.
%K A358656 nonn,more
%O A358656 1,1
%A A358656 _J.W.L. (Jan) Eerland_, Nov 27 2022
%E A358656 a(13) from _Daniel Suteu_, Dec 09 2022