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.

A007333 An upper bound on the biplanar crossing number of the complete graph on n nodes.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 4
10 7
11 12
12 18
13 37
14 53
15 75
16 100
17 152
18 198
19 256
20 320
21 430
22 530
23 650
24 780
25 980
26 1165
27 1380
28 1610
29 1939
30 2247
31 2597
32 2968
33 3472
34 3948
35 4480
36 5040
37 5772
38 6468
39 7236
40 8040
41 9060
42 10035
43 11100
44 12210
45 13585
46 14905
47 16335
48 17820
49 19624
50 21362

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 4, 7, 12, 18, 37, 53, 75, 100, 152, 198, 256, 320, 430, 530, 650, 780, 980, 1165, 1380, 1610, 1939, 2247, 2597, 2968, 3472, 3948, 4480, 5040, 5772, 6468, 7236, 8040, 9060, 10035, 11100, 12210, 13585, 14905, 16335, 17820, 19624, 21362]