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.

A317671 Regular triangle where T(n,k) is the number of labeled connected graphs on n + 1 vertices with k maximal blobs (2-connected components).

Table of values

n a(n)
1 1
2 1
3 3
4 10
5 12
6 16
7 238
8 215
9 150
10 125
11 11368
12 7740
13 4140
14 2160
15 1296
16 1014888
17 509446
18 205065
19 84035
20 36015
21 16807
22 166537616
23 59409952
24 17393152
25 5393920
26 1863680
27 688128
28 262144
29 50680432112
30 12321597708
31 2516756508
32 563570217
33 148803480
34 45467730

List of values

[1, 1, 3, 10, 12, 16, 238, 215, 150, 125, 11368, 7740, 4140, 2160, 1296, 1014888, 509446, 205065, 84035, 36015, 16807, 166537616, 59409952, 17393152, 5393920, 1863680, 688128, 262144, 50680432112, 12321597708, 2516756508, 563570217, 148803480, 45467730]