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.

A286951 Irregular triangle read by rows: T(n,k) is the number of simple graphs with n vertices with matching number k (0 <= k <= floor(n/2)).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 3
6 1
7 4
8 6
9 1
10 5
11 28
12 1
13 6
14 48
15 101
16 1
17 7
18 73
19 963
20 1
21 8
22 106
23 1818
24 10413
25 1
26 9
27 147
28 3383
29 271128
30 1
31 10
32 198
33 6129
34 441031
35 11557799

List of values

[1, 1, 1, 1, 1, 3, 1, 4, 6, 1, 5, 28, 1, 6, 48, 101, 1, 7, 73, 963, 1, 8, 106, 1818, 10413, 1, 9, 147, 3383, 271128, 1, 10, 198, 6129, 441031, 11557799]