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 A258429 #21 May 31 2025 20:19:58
%S A258429 2,5,17,65537
%N A258429 Primes p such that p - 1 = (tau(p - 1) - 1)^k for some k >= 0, where tau(n) is the number of divisors of n (A000005).
%C A258429 Conjecture: the sequence is finite.
%C A258429 Corresponding values of numbers k: 0, 2, 2, 4, ...
%C A258429 A Fermat prime from A019434 of the form F(n) = 2^(2^n) + 1 is a term if k = 2^n * log(2) / log(2^n) is an integer.
%e A258429 65537 (prime) is in the sequence because 65537 - 1 = (tau(65536) - 1)^4 = 16^4.
%o A258429 (Magma) [2] cat [n+1: n in [A219338(n)] | IsPrime(n+1)];
%o A258429 (Magma) Set(Sort([n: n in[1..1000000], k in [0..100] | IsPrime(n) and (n-1) eq (NumberOfDivisors(n-1) - 1)^k]));
%o A258429 (PARI) listp(nn) = {print1(p=2, ", "); forprime(p=5, nn, expo = valuation(x=(p-1), y=(numdiv(p-1)-1)); if (x == y^expo, print1(p, ", ")););} \\ _Michel Marcus_, Jun 04 2015
%Y A258429 Cf. A000005, A019434, A219338, A007516, A004249, A249759.
%K A258429 nonn
%O A258429 1,1
%A A258429 _Jaroslav Krizek_, May 29 2015