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.

A380362 Triangle read by rows: T(n,k) is the number of Halin graphs on n unlabeled nodes with circuit rank k, 3 <= k <= n-1.

Table of values

n a(n)
4 1
5 0
6 1
7 0
8 1
9 1
10 0
11 0
12 1
13 1
14 0
15 0
16 1
17 2
18 1
19 0
20 0
21 0
22 3
23 2
24 1
25 0
26 0
27 0
28 3
29 6
30 3
31 1
32 0
33 0
34 0
35 0
36 7
37 11
38 3
39 1
40 0
41 0
42 0
43 0
44 4
45 24
46 17
47 4
48 1
49 0
50 0
51 0
52 0
53 0
54 24
55 51
56 26
57 4
58 1
59 0
60 0
61 0
62 0
63 0
64 12
65 89
66 109
67 36
68 5
69 1
70 0
71 0
72 0
73 0
74 0
75 0
76 74
77 265
78 194
79 50
80 5
81 1
82 0
83 0
84 0
85 0
86 0
87 0
88 27
89 371
90 660
91 345
92 65
93 6
94 1

List of values

[1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 0, 3, 2, 1, 0, 0, 0, 3, 6, 3, 1, 0, 0, 0, 0, 7, 11, 3, 1, 0, 0, 0, 0, 4, 24, 17, 4, 1, 0, 0, 0, 0, 0, 24, 51, 26, 4, 1, 0, 0, 0, 0, 0, 12, 89, 109, 36, 5, 1, 0, 0, 0, 0, 0, 0, 74, 265, 194, 50, 5, 1, 0, 0, 0, 0, 0, 0, 27, 371, 660, 345, 65, 6, 1]