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.

A049334 Triangle read by rows: T(n, k) is the number of unlabeled connected planar simple graphs with n >= 1 nodes and 0<=k<=3*n-6 edges.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 0
6 1
7 1
8 0
9 0
10 0
11 2
12 2
13 1
14 1
15 0
16 0
17 0
18 0
19 3
20 5
21 5
22 4
23 2
24 1
25 0
26 0
27 0
28 0
29 0
30 6
31 13
32 19
33 22
34 19
35 13
36 5
37 2
38 0
39 0
40 0
41 0
42 0
43 0
44 11
45 33
46 67
47 107
48 130
49 130
50 96
51 51
52 16
53 5
54 0
55 0
56 0
57 0
58 0
59 0
60 0
61 23
62 89
63 236
64 486
65 804
66 1112
67 1211
68 1026
69 626
70 275
71 72
72 14
73 0
74 0
75 0
76 0
77 0
78 0
79 0
80 0

List of values

[1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 2, 2, 1, 1, 0, 0, 0, 0, 3, 5, 5, 4, 2, 1, 0, 0, 0, 0, 0, 6, 13, 19, 22, 19, 13, 5, 2, 0, 0, 0, 0, 0, 0, 11, 33, 67, 107, 130, 130, 96, 51, 16, 5, 0, 0, 0, 0, 0, 0, 0, 23, 89, 236, 486, 804, 1112, 1211, 1026, 626, 275, 72, 14, 0, 0, 0, 0, 0, 0, 0, 0]