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 A112715 #9 May 23 2017 21:59:23
%S A112715 3,7,11,23,31,47,79,127,191,223,239,383,479,607,863,991,1087,1151,
%T A112715 1279,1471,1663,2111,2239,2687,2879,3391,3583,3967,5119,5503,6143,
%U A112715 6271,6911,7039,8191,8447,8831,9343,10111,11519,11903,12671,12799,13183,13567
%N A112715 Primes in A112714.
%H A112715 Robert Israel, <a href="/A112715/b112715.txt">Table of n, a(n) for n = 1..10000</a>
%e A112715 a(1)=3 because 3=1*2^2-1 and it is the first prime of this form.
%p A112715 N:= 10^6: # to get all terms <= N
%p A112715 sort(convert(select(isprime,{seq(seq(k*2^m-1,k=1..min((N+1)/2^m,2^m-1),2),m=1..ilog2(N+1))}),list)); # _Robert Israel_, May 23 2017
%t A112715 Take[Sort@ Select[Flatten@ Table[k 2^m - 1, {m, 0, 15}, {k, 1, 2^m - 1, 2}], PrimeQ], 45] (* _Michael De Vlieger_, May 23 2017, after _Robert G. Wilson v_ at A112714 *)
%o A112715 (PARI) for(n=2,8,for(k=2^(n-2)+1,2^n,M=k*2^n-1;if(isprime(M),print1(M","),0)))
%Y A112715 Cf. A080076.
%K A112715 easy,nonn
%O A112715 1,1
%A A112715 Jose Brox (tautocrona(AT)terra.es), Dec 31 2005