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.

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

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 3
6 4
7 8
8 13
9 26
10 45
11 83
12 152
13 281
14 523
15 974
16 1822
17 3451
18 6490
19 12348
20 23389
21 44598
22 85076
23 162735
24 311721
25 598669
26 1150613
27 2215562
28 4271844
29 8247356
30 15941844
31 30849114
32 59758104
33 115878009
34 224900328

List of values

[0, 0, 0, 1, 1, 3, 4, 8, 13, 26, 45, 83, 152, 281, 523, 974, 1822, 3451, 6490, 12348, 23389, 44598, 85076, 162735, 311721, 598669, 1150613, 2215562, 4271844, 8247356, 15941844, 30849114, 59758104, 115878009, 224900328]