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.

A299038 Number A(n,k) of rooted trees with n nodes where each node has at most k children; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

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

List of values

[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 0, 1, 1, 1, 2, 3, 1, 0, 1, 1, 1, 2, 4, 6, 1, 0, 1, 1, 1, 2, 4, 8, 11, 1, 0, 1, 1, 1, 2, 4, 9, 17, 23, 1, 0, 1, 1, 1, 2, 4, 9, 19, 39, 46, 1, 0, 1, 1, 1, 2, 4, 9, 20, 45, 89, 98, 1, 0, 1, 1, 1, 2, 4, 9, 20, 47, 106, 211, 207, 1, 0]