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 A214956 #14 Oct 18 2018 11:02:56 %S A214956 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, %T A214956 1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,4,4,6,6,7, %U A214956 7,7,8,8,8,8,8 %N A214956 Number of primes of the form x^32 + 1 less than 10^n. %C A214956 It is conjectured that there are infinitely many primes of the form x^32 + 1 (and thus this sequence never becomes constant), but this has not been proved. %H A214956 Chai Wah Wu, <a href="/A214956/b214956.txt">Table of n, a(n) for n = 1..304</a> (n = 1..128 from Henryk Dabrowski) %e A214956 a(55) = 2 because the only primes of the form x^32 + 1 < 10^55 are the primes: 2, 185302018885184100000000000000000000000000000001. %o A214956 (PARI) a(n) = sum(k=1, (10^n-1)^(1/32), isprime(k^32+1)) %Y A214956 Cf. A006315 (k such that k^32+1 is prime). %Y A214956 Cf. A083844, A214452, A214454, A214455. %K A214956 nonn %O A214956 1,48 %A A214956 _Henryk Dabrowski_, Jul 30 2012