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.

A362957 a(n) is the least prime p such that the number of distinct prime factors of p^n + 1 sets a new record.

This page as a plain text file.
%I A362957 #8 Jun 13 2023 15:39:48
%S A362957 2,3,5,43,17,47,151,1697,59,2153,521,13183,30089,20753,3769
%N A362957 a(n) is the least prime p such that the number of distinct prime factors of p^n + 1 sets a new record.
%C A362957 a(16) > 2.3*10^6; to see if there has been any progress see also A280005(16).
%o A362957 (PARI) smallf(q,nmax) = {my(qq=q,j=0); forprime (p=2, nmax, my(k=0); while (qq%p==0, k++; qq/=p); if (k>0, j++;)); [j,qq]};
%o A362957 a362957(upto) = {my(nfmax=0); for (n=1, upto, forprime (p=2, oo, my(f=p^n+1, s=smallf(f,p)); if (s[1]<n\3, next); my(nf=omega(s[2])+s[1]); if (nf>nfmax, print1(p,", "); nfmax=nf; break)))};
%o A362957 a362957(12)
%Y A362957 Cf. A001221, A115973, A125137, A280005.
%K A362957 nonn,hard,more
%O A362957 1,1
%A A362957 _Hugo Pfoertner_, Jun 11 2023