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 A001771 M3784 N1541 #37 Nov 06 2023 14:58:26
%S A001771 1,5,9,17,21,29,45,177,18381,22529,24557,26109,34857,41957,67421,
%T A001771 70209,169085,173489,177977,363929,372897
%N A001771 Numbers k such that 7*2^k - 1 is prime.
%C A001771 k is always of the form 4*j + 1.
%C A001771 If k is in the sequence and m=2^(k+2)*3*(7*2^k-1) then phi(m)+sigma(m)=3m (m is in the sequence A011251). The proof is easy. - _Farideh Firoozbakht_, Mar 04 2005
%D A001771 H. Riesel, "Prime numbers and computer methods for factorization", Progress in Mathematics, Vol. 57, Birkhäuser, Boston, 1985, Chap. 4, see pp. 381-384.
%D A001771 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001771 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001771 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a>
%H A001771 H. C. Williams and C. R. Zarnke, <a href="http://dx.doi.org/10.1090/S0025-5718-1968-0227095-2">A report on prime numbers of the forms M = (6a+1)*2^(2m-1)-1 and (6a-1)*2^(2m)-1</a>, Math. Comp., 22 (1968), 420-422.
%H A001771 <a href="/index/Pri#riesel">Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime</a>
%t A001771 Do[ If[ PrimeQ[7*2^n - 1], Print[n]], {n, 1, 2500}]
%o A001771 (PARI) v=[ ]; for(n=0,2000, if(isprime(7*2^n-1),v=concat(v,n),)); v
%Y A001771 Cf. A050523, A003307, A002235, A046865, A079906, A046866, A005541, A056725, A046867, A079907.
%Y A001771 Cf. A032353 (7*2^k+1 is prime).
%K A001771 hard,nonn,more
%O A001771 1,2
%A A001771 _N. J. A. Sloane_
%E A001771 More terms from Douglas Burke (dburke(AT)nevada.edu).
%E A001771 More terms from _Hugo Pfoertner_, Jun 23 2004