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 A124181 #22 Sep 08 2022 08:45:28
%S A124181 1,3,69,86,104,110,138,146,210,238,247,260,264,269,316,436,572,600,
%T A124181 621,654,666,715,737,740,744,754,779,1056,1156,1159,1216,1218,1221,
%U A124181 1343,1419,1434,1442,1524,1580,1603,1676,1680,1731,1742,1804,1952,1956,1985
%N A124181 Numbers n such that 1 + n + n^3 + n^5 + n^7 + n^9 + n^11 + n^13 + n^15 + n^17 + n^19 + n^21 + n^23 is prime.
%H A124181 Vincenzo Librandi, <a href="/A124181/b124181.txt">Table of n, a(n) for n = 1..1390</a>
%F A124181 1 together with numbers n such that (n^25-n)/(n^2-1) + 1 is prime. - _Charles R Greathouse IV_, Jul 02 2013
%t A124181 Do[If[PrimeQ[1 + n + n^3 + n^5 + n^7 + n^9 + n^11 + n^13 + n^15 + n^17 + n^19 + n^21 + n^23], Print[n]], {n, 1, 1400}]
%t A124181 Select[Range[3000], PrimeQ[Total[#^Range[1, 23, 2]] + 1] &] (* _Vincenzo Librandi_, Jun 28 2014 *)
%o A124181 (PARI) is(n)=n==1 || isprime((n^25-n)/(n^2-1)+1) \\ _Charles R Greathouse IV_, Jul 02 2013
%o A124181 (Sage)
%o A124181 i,n = var('i,n')
%o A124181 [n for n in (1..2000) if is_prime(1+(n^(2*i+1)).sum(i,0,11))] # _Bruno Berselli_, Jun 27 2014
%o A124181 (Magma) [n: n in [0..2000] | IsPrime(s) where s is 1+&+[n^i: i in [1..23 by 2]]]; // _Vincenzo Librandi_, Jun 28 2014
%Y A124181 Cf. A049407, similar sequences listed in A244376.
%K A124181 nonn,easy
%O A124181 1,2
%A A124181 _Artur Jasinski_, Dec 13 2006