cp's OEIS Frontend

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.

A091232 How many more primes than irreducible GF(2)[X] polynomials there are in range [2^n,2^(n+1)].

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 2
5 1
6 4
7 5
8 13
9 19
10 38
11 69
12 129
13 242
14 451
15 848
16 1629
17 3039
18 5858
19 11041
20 21209
21 40478
22 77659
23 148986
24 286948
25 551944
26 1064949
27 2056282
28 3975512
29 7694488
30 14907270
31 28908990
32 56119905
33 109022319
34 211980753

List of values

[0, 0, 1, 0, 2, 1, 4, 5, 13, 19, 38, 69, 129, 242, 451, 848, 1629, 3039, 5858, 11041, 21209, 40478, 77659, 148986, 286948, 551944, 1064949, 2056282, 3975512, 7694488, 14907270, 28908990, 56119905, 109022319, 211980753]