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.

A276511 Primes that are equal to the sum of the prime factors of some perfect number.

This page as a plain text file.
%I A276511 #29 Sep 08 2022 08:46:17
%S A276511 5,11,139,170141183460469231731687303715884105979
%N A276511 Primes that are equal to the sum of the prime factors of some perfect number.
%C A276511 Primes of the form 2^n + 2*n - 3 such that 2^n - 1 is also prime.
%C A276511 Conjectures (defining x = 170141183460469231731687303715884105727 = A007013(4)):
%C A276511 (1) 2^x + 2*x - 3 is in this sequence;
%C A276511 (2) a(5) = 2^x + 2*x - 3 (see comments of A276493);
%C A276511 (3) primes of A007013 are Mersenne prime exponents A000043, i.e., x is new exponent in A000043.
%e A276511 a(1) = 5 because 2^2-1 = 3 and 2^2+2*2-3 = 5 are primes,
%e A276511 a(2) = 11 because 2^3-1 = 7 and 2^3+2*3-3 = 11 are primes,
%e A276511 a(3) = 139 because 2^7-1 = 127 and 2^7+2*7-3 = 139 are primes.
%p A276511 A276511:=n->`if`(isprime(2^n-1) and isprime(2^n+2*n-3), 2^n+2*n-3, NULL): seq(A276511(n), n=1..10^3); # _Wesley Ivan Hurt_, Sep 07 2016
%o A276511 (Magma) [2^n+2*n-3: n in [1..200] | IsPrime(2^n-1) and IsPrime(2^n+2*n-3)];
%Y A276511 Subsequence of A192436.
%Y A276511 Cf. A000043, A000396, A000668, A007013, A100118, A276493.
%K A276511 nonn,more
%O A276511 1,1
%A A276511 _Juri-Stepan Gerasimov_, Sep 06 2016
%E A276511 Name suggested by _Michel Marcus_, Sep 07 2016