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.

A327237 Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices that, if the isolated vertices are removed, have cut-connectivity k.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 0
5 1
6 1
7 3
8 3
9 1
10 4
11 40
12 15
13 4
14 1
15 56
16 660
17 267
18 35
19 5
20 1
21 1031
22 18756
23 11022
24 1862
25 90
26 6
27 1

List of values

[1, 1, 0, 1, 0, 1, 1, 3, 3, 1, 4, 40, 15, 4, 1, 56, 660, 267, 35, 5, 1, 1031, 18756, 11022, 1862, 90, 6, 1]