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 A221983 #6 Feb 04 2013 18:10:38
%S A221983 1,2,3,3,4,4,4,4,5,6,6,8,9,9,9,12,15,18,24,30,35,41,46,66,83,104,133,
%T A221983 166,195,247,314,400,475,589,709,855,1046,1313,1604,1998,2468,3029,
%U A221983 3681,4518,5581,6920,8629,10647,13122,16214,19894,24644,30569,37864,46927
%N A221983 Number of primes of the form (x+1)^11 - x^11 less than 10^n.
%C A221983 Number of primes less than 10^n and equal to the difference of two consecutive eleventh powers (x+1)^11 - x^11 = 11x(x+1)(x^2+x+1)( x(x+1)(x^2+x+1)(x^2+x+3)+1) + 1 (A189055). Values of x = A211184. Sequence of number of primes less than 10^n and of the form (x+1)^11 - x^11 have similar characteristics to similar sequences for natural primes (A006880), cuban primes (A113478) and primes of the form (x+1)^p - x^p for p = 5 (A221846) and p = 7 (A221977).
%H A221983 Vladimir Pletser, <a href="/A221983/b221983.txt">Table of n, a(n) for n = 9..86</a>
%t A221983 nn = 40; t = Table[0, {nn}]; n = 0; While[n++; p = (n + 1)^11 - n^11; p < 10^nn, If[PrimeQ[p], m = Ceiling[Log[10, p]]; t[[m]]++]]; Accumulate[t] (* _T. D. Noe_, Feb 04 2013 *)
%K A221983 nonn
%O A221983 9,2
%A A221983 _Vladimir Pletser_, Feb 02 2013