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.

A325304 Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with matching number k, (0 <= k <= floor(n/2)).

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 0
5 2
6 0
7 1
8 5
9 0
10 1
11 20
12 0
13 1
14 16
15 95
16 0
17 1
18 22
19 830
20 0
21 1
22 29
23 790
24 10297
25 0
26 1
27 37
28 1479
29 259563
30 0
31 1
32 46
33 2625
34 166988
35 11546911

List of values

[1, 1, 0, 1, 0, 2, 0, 1, 5, 0, 1, 20, 0, 1, 16, 95, 0, 1, 22, 830, 0, 1, 29, 790, 10297, 0, 1, 37, 1479, 259563, 0, 1, 46, 2625, 166988, 11546911]