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 A249383 #12 Oct 28 2014 01:35:03
%S A249383 3,3,7,3,31,7,61,43,79,19,739,103,2707,4513,139,13,4027,28027,14029,
%T A249383 87151,11257,8677,122449,104161,113287,216211,150097,862009,876721,
%U A249383 414949,4590451,1391281
%N A249383 Smallest odd prime number Q such that Q*2^P-1 is also prime with P Mersenne prime exponent A000043(n).
%C A249383 a(32) is a 227838-digit certified prime.
%C A249383 Does a(n) exist for each n? - _Charles R Greathouse IV_, Oct 28 2014
%o A249383 (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 A249383 Cf. A000043, A249382, A249384.
%K A249383 nonn
%O A249383 1,1
%A A249383 _Pierre CAMI_, Oct 27 2014