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.

A383656 Triangular array read by rows: T(n,k) is the number of n-node Stanley graphs containing exactly k connected components, n>=0, 0<=k<=n.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 2
8 3
9 1
10 0
11 8
12 11
13 6
14 1
15 0
16 52
17 60
18 35
19 10
20 1
21 0
22 502
23 472
24 255
25 85
26 15
27 1
28 0
29 6824
30 5166
31 2422
32 805
33 175
34 21
35 1
36 0
37 127166
38 76712
39 30072
40 9177
41 2100
42 322
43 28
44 1
45 0
46 3205924
47 1526910
48 486800
49 129360
50 28497
51 4788
52 546
53 36
54 1
55 0
56 108975934
57 40603534
58 10292970
59 2285240
60 455805
61 76629
62 9870
63 870
64 45
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 2, 3, 1, 0, 8, 11, 6, 1, 0, 52, 60, 35, 10, 1, 0, 502, 472, 255, 85, 15, 1, 0, 6824, 5166, 2422, 805, 175, 21, 1, 0, 127166, 76712, 30072, 9177, 2100, 322, 28, 1, 0, 3205924, 1526910, 486800, 129360, 28497, 4788, 546, 36, 1, 0, 108975934, 40603534, 10292970, 2285240, 455805, 76629, 9870, 870, 45, 1]