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 A292237 #9 Sep 13 2017 03:13:48 %S A292237 17,19,31,41,59,61,67,71,89,101,103,107,109,127,137,139,149,157,163, %T A292237 167,193,199,227,229,241,257,269,271,293,311,313,331,347,349,373,379, %U A292237 389,401,409,421,433,449,479,503,509,521,523,541,563,599,607,613,631,647 %N A292237 Primes p such that gpf(lpf(2^p - 1) - 1) > p. %C A292237 Complement of A291691 w.r.t. primes. %C A292237 Are there infinitely many such primes? - _Thomas Ordowski_, Sep 12 2017 %e A292237 For p=17, we have gpf(lpf(2^p - 1) - 1) = 257 which is > 17, so 17 is a term. %o A292237 (PARI) lista(nn) = forprime(p=2, nn, if (vecmax(factor(vecmin(factor(2^p-1)[, 1])-1)[, 1]) > p, print1(p, ", "));); %Y A292237 Cf. A001348, A291691, A292238. %K A292237 nonn %O A292237 1,1 %A A292237 _Michel Marcus_, Sep 12 2017