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.

A318753 Number A(n,k) of rooted trees with n nodes such that no more than k subtrees extending from the same node have the same number of nodes; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

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

List of values

[0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 3, 3, 0, 0, 1, 1, 2, 4, 7, 6, 0, 0, 1, 1, 2, 4, 8, 15, 12, 0, 0, 1, 1, 2, 4, 9, 18, 34, 25, 0, 0, 1, 1, 2, 4, 9, 19, 43, 79, 51, 0, 0, 1, 1, 2, 4, 9, 20, 46, 102, 190, 111, 0, 0, 1, 1, 2, 4, 9, 20, 47, 110, 250, 457, 240, 0]