cp's OEIS Frontend

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.

A112634 Mersenne prime indices that are not Gaussian primes.

This page as a plain text file.
%I A112634 #33 Dec 03 2024 12:44:05
%S A112634 2,5,13,17,61,89,521,2281,3217,4253,9689,9941,11213,19937,21701,23209,
%T A112634 44497,132049,859433,1398269,2976221,3021377,6972593,13466917,
%U A112634 30402457,32582657,42643801,43112609,57885161
%N A112634 Mersenne prime indices that are not Gaussian primes.
%C A112634 57885161, 74207281 and 77232917 are in this sequence as well. - _Ivan Panchenko_, Apr 13 2018
%C A112634 82589933 is in the sequence as well. - _David Benjamin_, Mar 30 2022
%C A112634 136279841 is in the sequence. - _David Benjamin_, Nov 11 2024
%C A112634 Other than the term 2, primes p (A000043) such that 2^p - 1 is prime (A000668) and congruent to 31 mod 120. - _Jianing Song_, Nov 18 2024
%H A112634 Chris K. Caldwell, <a href="https://t5k.org/largest.html">The largest known primes</a>.
%F A112634 A000043 INTERSECT A002313. - _R. J. Mathar_, Oct 06 2008
%F A112634 A000043 SET-MINUS A112633.
%t A112634 Select[MersennePrimeExponent[Range[48]], Mod[#, 4] != 3 &] (* _Amiram Eldar_, Oct 18 2024 *)
%o A112634 (PARI) is(n)=n%4 < 3 && isprime(n) && isprime(2^n-1) \\ _Charles R Greathouse IV_, Nov 28 2016
%Y A112634 Cf. A000043, A112633, A002313.
%K A112634 nonn,more
%O A112634 1,1
%A A112634 _Jorge Coveiro_, Dec 27 2005
%E A112634 Edited by _R. J. Mathar_, Oct 06 2008
%E A112634 a(26)-a(28) from _Ivan Panchenko_, Apr 13 2018
%E A112634 a(29) from _Amiram Eldar_, Oct 18 2024