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 A126715 #37 Oct 31 2023 04:46:33
%S A126715 3,3,3,3,3,7,3,3,5,7,5,3,5,31,5,79,17,7,3,61,17,7,83,13,83,61,11,193,
%T A126715 83,7,521,43,5,31,3,31,17,31,3,61,107,19,53,3,557,7,23,31,5,19,11,
%U A126715 1033,89,307,5,3,563,79,83,733,17,79,53,61,3,67,257,43,179,139,47,73,5,421,113
%N A126715 a(n) is the smallest odd prime p such that p*2^n - 1 is prime.
%C A126715 By Xylouris's version of Linnik's theorem, a(n) << 2^(5.2n). - _Charles R Greathouse IV_, Dec 28 2011
%C A126715 a(n) = prime(k) for some k < 5*n. - _Pierre CAMI_, Jul 20 2014
%H A126715 Pierre CAMI, <a href="/A126715/b126715.txt">Table of n, a(n) for n = 0..10000</a> (first 2501 terms from T. D. Noe)
%t A126715 f[n_] := Block[{k = 2}, While[ !PrimeQ[ Prime[k]*2^n - 1], k++ ]; Prime@k]; Table[f@n, {n, 0, 74}] (* _Robert G. Wilson v_, Feb 16 2007 *)
%o A126715 (PARI) a(n) = p=3; t=2^n; while(!isprime(p*t-1), p=nextprime(p+1)); p \\ _Colin Barker_, Jul 22 2014
%K A126715 nonn
%O A126715 0,1
%A A126715 _Pierre CAMI_, Feb 13 2007
%E A126715 More terms from _Robert G. Wilson v_, Feb 16 2007
%E A126715 Entries checked and some errors corrected by _N. J. A. Sloane_, Mar 02 2007