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 A191060 #23 May 22 2022 09:49:36 %S A191060 2,7,13,17,19,29,41,43,61,73,79,83,101,107,109,127,131,139,149,151, %T A191060 167,173,193,197,211,227,233,239,241,263,271,277,281,283,293,307,337, %U A191060 347,349,359,373,409,431,439,457,461,479,491,503,523,541,547,557,563 %N A191060 Primes that are not squares mod 11. %C A191060 Inert rational primes in the field Q(sqrt(-11)). - _N. J. A. Sloane_, Dec 25 2017 %C A191060 These are also the primes p for which the polynomial x^3 - x^2 - x - 1 (mod p) has only one integer root. This is important for the Fibonacci and Lucas 3-step recursions, A000073 and A001644. See A106276. - _T. D. Noe_, Apr 17 2012 %C A191060 It appears that these are the primes p such that the sequence p^(5*n) mod 11 has period length 2, repeating [1, 10]. - _Gary Detlefs_, May 18 2014 %H A191060 Vincenzo Librandi, <a href="/A191060/b191060.txt">Table of n, a(n) for n = 1..1000</a> %H A191060 <a href="https://oeis.org/index/Pri#primes_decomp_of">Index to sequences related to decomposition of primes in quadratic fields</a> %t A191060 Select[Prime[Range[200]], JacobiSymbol[#, 11] == -1 &] %o A191060 (Magma) [p: p in PrimesUpTo(563) | JacobiSymbol(p, 11) eq -1]; // _Vincenzo Librandi_, Sep 11 2012 %K A191060 nonn,easy %O A191060 1,1 %A A191060 _T. D. Noe_, May 25 2011