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.

A383448 Irregular triangle read by rows: T(n,k) (n>=1, k>=0) is the number of trees with n nodes in which there are k edges whose end-vertices have the same degree.

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 1
6 1
7 2
8 0
9 1
10 3
11 2
12 0
13 1
14 6
15 3
16 1
17 0
18 1
19 9
20 7
21 5
22 1
23 0
24 1
25 19
26 12
27 10
28 4
29 1
30 0
31 1
32 33
33 33
34 18
35 15
36 5
37 1
38 0
39 1
40 67
41 66
42 54
43 26
44 15
45 5
46 1
47 0
48 1
49 130
50 154
51 128
52 77
53 36
54 18
55 6
56 1
57 0
58 1
59 270
60 344
61 309
62 199
63 110
64 40
65 21
66 6
67 1
68 0
69 1
70 547
71 806
72 752
73 530
74 294
75 147
76 50
77 24
78 7
79 1
80 0
81 1

List of values

[1, 0, 1, 1, 1, 1, 2, 0, 1, 3, 2, 0, 1, 6, 3, 1, 0, 1, 9, 7, 5, 1, 0, 1, 19, 12, 10, 4, 1, 0, 1, 33, 33, 18, 15, 5, 1, 0, 1, 67, 66, 54, 26, 15, 5, 1, 0, 1, 130, 154, 128, 77, 36, 18, 6, 1, 0, 1, 270, 344, 309, 199, 110, 40, 21, 6, 1, 0, 1, 547, 806, 752, 530, 294, 147, 50, 24, 7, 1, 0, 1]