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 A363585 #18 Feb 10 2024 05:23:52
%S A363585 5,2,23,127,71,353,1279,3851,3049,18913,47129,352073,696809
%N A363585 Least prime p such that p^n + 6 is the product of n distinct primes.
%C A363585 Corresponding values of p^n + 6 are 11, 10, 12173, 260144647, 1804229357, 1934854145598535, 5598785270206921122565, ...
%C A363585 Upper bounds for the next terms are a(12) <= 352073, a(13) <= 696809, a(14) <= 1496423. - _Hugo Pfoertner_, Jun 11 2023
%e A363585 a(1) = 5; 5^1 + 6 = 11.
%e A363585 a(2) = 2; 2^2 + 6 = 2 * 5.
%e A363585 a(3) = 23; 23^3 + 6 = 7 * 37 * 47.
%e A363585 a(4) = 127; 127^4 + 6 = 7 * 131 * 367 * 773.
%t A363585 Table[b=6;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 A363585 (PARI) a(n) = forprime(p=2, , my(f=factor(p^n + 6)); if (issquarefree(f) && (omega(f) == n), return(p)));
%Y A363585 Cf. A000961, A001221, A005117, A280005, A358656, A362957.
%K A363585 nonn,hard,more
%O A363585 1,1
%A A363585 _J.W.L. (Jan) Eerland_, Jun 10 2023
%E A363585 a(11) from _Hugo Pfoertner_, Jun 11 2023
%E A363585 a(12) from _J.W.L. (Jan) Eerland_, Jan 07 2024
%E A363585 a(13) from _Hugo Pfoertner_, confirmed by _Daniel Suteu_, Feb 10 2024