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 A265499 #21 Sep 08 2022 08:46:14 %S A265499 1,226,273,544,675,961,1380,1968,2155,2193,2596,3481,3774,4074,4513, %T A265499 4674,4866,4899,5004,5418,5421,5536,5815,5949,6159,6249,6390,6523, %U A265499 6526,6543,7230,7281,7645,7699,7968,8473,8518,8724,8763,8871,9519,9780,9805 %N A265499 Numbers n such that n*2^607 - 1 is prime. %C A265499 The exponent of 2 in the expression, 607, is a Mersenne exponent. %e A265499 n = 1 is a term since 2^607 - 1 is prime (the 14th Mersenne prime). %t A265499 Select[Range@ 12250, PrimeQ[# 2^607 - 1] &] (* _Michael De Vlieger_, Dec 09 2015 *) %o A265499 (MATLAB) %o A265499 if isprime(n*2^607-1) %o A265499 disp(n) %o A265499 end %o A265499 (PARI) is(n)=ispseudoprime(n*2^607 - 1) \\ _Anders Hellström_, Dec 09 2015 %o A265499 (Magma) [n: n in [1..2*10^4] |IsPrime(n*2^607-1)]; // _Vincenzo Librandi_, Dec 10 2015 %Y A265499 Cf. A000043, A001348, A005122. %K A265499 nonn,easy %O A265499 1,2 %A A265499 _Vardan Semerjyan_, Dec 09 2015