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.

A162862 Numbers n such that n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1 is prime.

This page as a plain text file.
%I A162862 #17 Sep 05 2018 09:03:45
%S A162862 1,5,17,20,21,30,53,60,86,137,172,195,212,224,229,258,268,272,319,339,
%T A162862 355,365,366,389,390,398,414,467,480,504,534,539,543,567,592,619,626,
%U A162862 654,709,735,756,766,770,778,787,806,812,874,943,973,1003,1036,1040
%N A162862 Numbers n such that n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1 is prime.
%C A162862 The associated primes are in A162861.
%C A162862 Numbers n such that Phi(11,n) is prime, where Phi(11,n) = (n^11 - 1)/(n - 1) is the eleventh cyclotomic polynomial. - _Jianing Song_, Sep 05 2018
%H A162862 Charles R Greathouse IV, <a href="/A162862/b162862.txt">Table of n, a(n) for n = 1..10000</a>
%H A162862 <a href="/index/Cy#CyclotomicPolynomialsValuesAtX">Index to values of cyclotomic polynomials of integer argument</a>
%F A162862 A000040 INTERSECT A060885.
%t A162862 Select[Range[100], PrimeQ[1 + Sum[#^i, {i, 10}]] &] (* _Alonso del Arte_, Apr 11 2014 *)
%o A162862 (PARI) is(n)=isprime(polcyclo(11,n)) \\ _Charles R Greathouse IV_, Sep 14 2015
%Y A162862 Cf. A060885, A162861.
%K A162862 nonn
%O A162862 1,2
%A A162862 _Vladimir Joseph Stephan Orlovsky_, Jul 14 2009