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.

A217654 Triangular array read by rows. T(n,k) is the number of unlabeled directed graphs of n nodes that have exactly k isolated nodes.

Table of values

n a(n)
0 1
1 0
2 1
3 2
4 0
5 1
6 13
7 2
8 0
9 1
10 202
11 13
12 2
13 0
14 1
15 9390
16 202
17 13
18 2
19 0
20 1
21 1531336
22 9390
23 202
24 13
25 2
26 0
27 1
28 880492496
29 1531336
30 9390
31 202
32 13
33 2
34 0
35 1
36 1792477159408
37 880492496
38 1531336
39 9390
40 202
41 13
42 2
43 0
44 1
45 13026163465206704
46 1792477159408
47 880492496
48 1531336
49 9390
50 202
51 13
52 2
53 0
54 1

List of values

[1, 0, 1, 2, 0, 1, 13, 2, 0, 1, 202, 13, 2, 0, 1, 9390, 202, 13, 2, 0, 1, 1531336, 9390, 202, 13, 2, 0, 1, 880492496, 1531336, 9390, 202, 13, 2, 0, 1, 1792477159408, 880492496, 1531336, 9390, 202, 13, 2, 0, 1, 13026163465206704, 1792477159408, 880492496, 1531336, 9390, 202, 13, 2, 0, 1]