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.

A112739 Array counting nodes in rooted trees of height n in which the root and internal nodes have valency k (and the leaf nodes have valency one).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 3
8 2
9 1
10 1
11 4
12 5
13 2
14 1
15 1
16 5
17 10
18 7
19 2
20 1
21 1
22 6
23 17
24 22
25 9
26 2
27 1
28 1
29 7
30 26
31 53
32 46
33 11
34 2
35 1
36 1
37 8
38 37
39 106
40 161
41 94
42 13
43 2
44 1
45 1
46 9
47 50
48 187
49 426
50 485
51 190
52 15
53 2
54 1
55 1
56 10
57 65
58 302
59 937
60 1706
61 1457
62 382
63 17
64 2
65 1
66 1
67 11
68 82
69 457
70 1814
71 4687
72 6826
73 4373
74 766
75 19

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 4, 5, 2, 1, 1, 5, 10, 7, 2, 1, 1, 6, 17, 22, 9, 2, 1, 1, 7, 26, 53, 46, 11, 2, 1, 1, 8, 37, 106, 161, 94, 13, 2, 1, 1, 9, 50, 187, 426, 485, 190, 15, 2, 1, 1, 10, 65, 302, 937, 1706, 1457, 382, 17, 2, 1, 1, 11, 82, 457, 1814, 4687, 6826, 4373, 766, 19]