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 A249384 #10 Nov 21 2014 21:29:00
%S A249384 3,5,3,5,5,53,11,239,53,191,1229,5,233,347,1367,9767,2063,89,14009,
%T A249384 3329,19991,50849,2711,337871,46301,2543,413093,1157111,615161,
%U A249384 1138649,3778427
%N A249384 Smallest odd prime number Q such that Q*2^P+1 is also prime, where P is a Mersenne prime exponent A000043(n).
%o A249384 (PARI) lista(nn) = {vmp = readvec("b000043.txt"); for (n=1, nn, k=2; while(!isprime(prime(k)*2^vmp[n]+1), k++); print1(prime(k), ", "););} \\ _Michel Marcus_, Oct 27 2014
%Y A249384 Cf. A000043, A249382, A249383.
%K A249384 nonn,more
%O A249384 1,1
%A A249384 _Pierre CAMI_, Oct 27 2014