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.

A226216 Primes p such that (p-1)/ord(2,p) > (q-1)/ord(2,q) for odd primes q < p.

This page as a plain text file.
%I A226216 #23 Nov 16 2023 07:44:49
%S A226216 3,7,31,73,127,601,683,1103,1801,2731,5419,8191,43691,61681,65537,
%T A226216 121369,122921,131071,178481,262657,524287,2099863,2796203,6700417,
%U A226216 10567201,13264529,20394401,48544121,97685839,112901153,160465489,164511353,420778751,536903681,616318177
%N A226216 Primes p such that (p-1)/ord(2,p) > (q-1)/ord(2,q) for odd primes q < p.
%C A226216 Essentially records in A001917. Sequence is infinite.
%C A226216 The Mersenne primes (A000668) are a subset. - _Jeppe Stig Nielsen_, Aug 30 2015
%H A226216 Amiram Eldar, <a href="/A226216/b226216.txt">Table of n, a(n) for n = 1..47</a>
%F A226216 a(n) = prime(A152597(n)). - _Amiram Eldar_, Nov 16 2023
%t A226216 r=0; p=3; L={}; While[Length@L < 20, v = (p-1)/ MultiplicativeOrder[2, p]; If[v > r, r = v; AppendTo[L, p]]; p = NextPrime@ p]; L (* _Giovanni Resta_, Aug 31 2015 *)
%o A226216 (PARI) r=0;forprime(p=3,1e9,t=(p-1)/znorder(Mod(2,p));if(t>r,r=t;print1(p", ")))
%Y A226216 Cf. A000668, A001917, A014664, A152597, A152598.
%K A226216 nonn
%O A226216 1,1
%A A226216 _Charles R Greathouse IV_, May 31 2013