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 A265670 #12 Sep 08 2022 08:46:14 %S A265670 2,8,10,12,16,18,22,24,28,32,42,50,60,68,70,78,88,104,108,118,132,138, %T A265670 206,238,240,242,270,282,300,306,312,318,338,372,376,382,390,394,398, %U A265670 418,440,452,464,512,522,532,534,548,566,586,594,626,630,636,640,650 %N A265670 Numbers n such that n^5 + n^4 + n^3 + n^2 + n - 1 is prime. %C A265670 All terms are even. - _Altug Alkan_, Dec 13 2015 %e A265670 2 is in the sequence because 2^5 + 2^4 + 2^3 + 2^2 + 2 - 1 = 61 is prime. %t A265670 Select[Range[700], PrimeQ[Total[#^Range[1, 5, 1]] - 1] &] %o A265670 (Magma) [n: n in [0..700] | IsPrime(s) where s is n^5+n^4+n^3+n^2+n-1]; %o A265670 (PARI) print1(2, ", "); forcomposite(n=1, 1e4, if(ispseudoprime(n^5 + n^4 + n^3 + n^2 + n - 1), print1(n, ", "))) \\ _Altug Alkan_, Dec 13 2015 %Y A265670 Cf. A045546, A100331, A125964, A182424. %K A265670 nonn,easy %O A265670 1,1 %A A265670 _Vincenzo Librandi_, Dec 13 2015