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 A066651 #18 Feb 22 2021 09:16:31 %S A066651 3,5,7,11,13,23,29,31,43,47,53,59,61,67,71,79,83,103,107,131,139,149, %T A066651 157,167,173,179,191,211,223,227,229,239,263,269,277,283,293,311,317, %U A066651 331,347,349,359,367,373,383,389,419,421,431 %N A066651 Primes of the form 2*s + 1, where s is a squarefree number (A005117). %C A066651 For these odd primes delta(p) = A055034(n) = (p-1)/2 is squarefree, and therefore the (Abelian) multiplicative group Modd p (see a comment on A203571 for Modd n, not to be confused with mod n) is guaranteed to be cyclic. This is because the number of Abelian groups of order n (A000688) is 1 precisely for the squarefree numbers A005117. See also A210845. One can in fact prove that the multiplicative group Modd p is cyclic for all primes (the case p=2 is trivial). - _Wolfdieter Lang_, Sep 24 2012 %H A066651 Amiram Eldar, <a href="/A066651/b066651.txt">Table of n, a(n) for n = 1..10000</a> %e A066651 a(13) = A000040(18) = 61 = 2*30+1 = 2*A005117(19)+1. %t A066651 Select[2 * Select[Range[200], SquareFreeQ] + 1, PrimeQ] (* _Amiram Eldar_, Feb 22 2021 *) %o A066651 (PARI) isok(p) = isprime(p) && (p>2) && issquarefree((p-1)/2); \\ _Michel Marcus_, Feb 22 2021 %Y A066651 Cf. A005385, A066652, A066653. %K A066651 nonn %O A066651 1,1 %A A066651 _Reinhard Zumkeller_, Jan 10 2002