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 A075719 #12 Sep 08 2022 08:45:07 %S A075719 1,3,8,21,23,26,33,36,38,45,51,57,69,71,78,92,107,117,149,156,170,176, %T A075719 179,195,209,216,219,224,261,293,321,341,359,374,378,386,390,404,410, %U A075719 413,420,474,492,507,516,546,569,572,582,621,632,683,767,783,789,809 %N A075719 1+n+n^s is a prime, s=10. %C A075719 For s = 5,8,11,14,17,20,..., n_s=1+n+n^s is always composite for any n>1. Also at n=1, n_s=3 is a prime for any s. So it is interesting to consider only the cases of s =/= 5,8,11,14,17,20,... and n>1. Here i consider the case s=10 and find several first n's making n_s a prime (or a probable prime). %H A075719 Vincenzo Librandi, <a href="/A075719/b075719.txt">Table of n, a(n) for n = 1..3300</a> %e A075719 3 is OK because at s=10, n=3, n_s=1+n+n^s=59053 is a prime. %t A075719 Select[Range[1000], PrimeQ[1 + # + #^10] &] (* _Vincenzo Librandi_, Jul 28 2014 *) %o A075719 (PARI) for(n=1,1000,if(isprime(1+n+n^10),print1(n","))) %o A075719 (Magma) [n: n in [0..1000] | IsPrime(s) where s is 1+n+n^10]; // _Vincenzo Librandi_, Jul 28 2014 %Y A075719 Cf. A002384, A075718, A075720. %K A075719 nonn,easy %O A075719 1,2 %A A075719 _Zak Seidov_, Oct 03 2002 %E A075719 More terms from _Ralf Stephan_, Apr 05 2003