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.

A171131 Primes p such that sum of divisors of p-3 is prime.

This page as a plain text file.
%I A171131 #20 Aug 01 2024 18:16:04
%S A171131 5,7,19,67,4099,65539,262147,1073741827
%N A171131 Primes p such that sum of divisors of p-3 is prime.
%C A171131 No further terms up to the 10 millionth prime. - _Harvey P. Dale_, Apr 30 2012
%C A171131 If the sum of divisors of a number k is a prime (i.e., k is in A023194), then k is a prime power. If p is prime and p-3 is a prime power, then p-3 is even, so p-3 is a power of 2. Since p-3 = 2^m then sigma(2^m) = 2^(m+1)-1 is a prime. Therefore, all the terms are primes of the form 2^m+3 where m+1 is a Mersenne exponent (A000043), i.e., m is in the intersection of A057732 and {A000043(n)-1}. So, m = 1, 2, 4, 6, 12, 16, 18, 30, and no other value <= A057732(58) = 2205444. Therefore, a(9) > 2^2205444, if it exists. - _Amiram Eldar_, Aug 01 2024
%e A171131 5 is a term since it is a prime and sigma(5-3) = 3 is a prime.
%e A171131 7 is a term since it is a prime and sigma(7-3) = 7 is a prime.
%e A171131 19 is a term since it is a prime and sigma(19-3) = 31 is a prime.
%t A171131 f[n_]:=Plus@@Divisors[n]; lst={};Do[p=Prime[n];If[PrimeQ[f[p-3]],AppendTo[lst,p]],{n,2*10!}];lst
%t A171131 Select[Prime[Range[10000000]],PrimeQ[DivisorSigma[1,#-3]]&] (* _Harvey P. Dale_, Apr 30 2012 *)
%Y A171131 Cf. A000043, A000203, A023194, A057732, A171130, A153503.
%K A171131 nonn
%O A171131 1,1
%A A171131 _Vladimir Joseph Stephan Orlovsky_, Dec 04 2009
%E A171131 a(8)-a(10) from _Vincenzo Librandi_, Feb 04 2013
%E A171131 Two wrong terms removed by _Amiram Eldar_, Aug 01 2024