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.

A380633 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes of degree at most 3 with k cycles and each node a member of exactly one cycle, 0 <= k <= floor(n/3).

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 0
6 1
7 0
8 1
9 0
10 1
11 1
12 0
13 1
14 1
15 0
16 1
17 2
18 0
19 1
20 2
21 1
22 0
23 1
24 3
25 3
26 0
27 1
28 3
29 6
30 0
31 1
32 4
33 11
34 2
35 0
36 1
37 4
38 17
39 5
40 0
41 1
42 5
43 26
44 17
45 0
46 1
47 5
48 36
49 37
50 2
51 0
52 1
53 6
54 50
55 78
56 12
57 0
58 1
59 6
60 65
61 140
62 44
63 0
64 1
65 7
66 85
67 248
68 131
69 4
70 0
71 1
72 7
73 106
74 396
75 325
76 23

List of values

[1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 2, 1, 0, 1, 3, 3, 0, 1, 3, 6, 0, 1, 4, 11, 2, 0, 1, 4, 17, 5, 0, 1, 5, 26, 17, 0, 1, 5, 36, 37, 2, 0, 1, 6, 50, 78, 12, 0, 1, 6, 65, 140, 44, 0, 1, 7, 85, 248, 131, 4, 0, 1, 7, 106, 396, 325, 23]