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.

A320583 Irregular triangle read by rows: T(n,k) is the number of connected permutation graphs on n vertices with domination number k, with 1 <= k <= floor(n/2).

Table of values

n a(n)
1 1
2 1
3 3
4 10
5 3
6 43
7 28
8 223
9 236
10 2
11 1364
12 1842
13 62
14 9643
15 18433
16 1015
17 2
18 77545
19 181568
20 14146
21 84
22 699954
23 1938199
24 189077
25 2093
26 2

List of values

[1, 1, 3, 10, 3, 43, 28, 223, 236, 2, 1364, 1842, 62, 9643, 18433, 1015, 2, 77545, 181568, 14146, 84, 699954, 1938199, 189077, 2093, 2]