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 A057678 #30 Sep 20 2018 13:56:48
%S A057678 2,5,8179,524269
%N A057678 Primes of the form 2^p - p where p is prime.
%C A057678 Next term, if it exists, has more than 618 digits. - _Emeric Deutsch_, Mar 27 2005
%C A057678 Next term, if it exists, has more than 10,000 digits.
%C A057678 The corresponding primes p are: 2, 3, 13, 19, .... - _Gerasimov Sergey_, Jul 26 2013
%C A057678 The corresponding 2^p - 1 are 3, 7, 8191, 524287 which are Mersenne primes (A000668). Is this the case for all members of the sequence? None of the other Mersenne primes < 2^132049-1 correspond to members of the sequence. - _Robert Israel_, Jul 18 2016
%C A057678 Next term is 2^481801-481801. 2^481801-1 is not a Mersenne prime. - _Joerg Arndt_, Jul 19 2016
%e A057678 p=3 is prime, and so is 2^p - p = 8 - 3 = 5, so 5 is in the sequence. - _Michael B. Porter_, Jul 19 2016
%p A057678 a:=proc(n) if isprime(2^ithprime(n)-ithprime(n))=true then 2^ithprime(n)-ithprime(n) else fi end: seq(a(n),n=1..310); # _Emeric Deutsch_
%t A057678 lst={};Do[p=Prime[n];If[PrimeQ[p=2^p-p],AppendTo[lst,p]],{n,5!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jan 28 2009 *)
%t A057678 Select[Table[2^p-p,{p,Prime[Range[20]]}],PrimeQ] (* _Harvey P. Dale_, Sep 20 2018 *)
%Y A057678 Cf. A000668, A057663, A057664, A057665, A056677.
%K A057678 nonn,more
%O A057678 1,1
%A A057678 _Labos Elemer_, Oct 19 2000