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.

A126303 a(n) = number of nodes with odd distance to the root in the n-th plane general tree encoded by A014486(n). Both internal and terminal nodes (leaves) are counted.

Table of values

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

List of values

[0, 1, 2, 1, 3, 2, 2, 1, 2, 4, 3, 3, 2, 3, 3, 2, 2, 1, 2, 3, 2, 3, 2, 5, 4, 4, 3, 4, 4, 3, 3, 2, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 3, 2, 2, 1, 2, 3, 2, 3, 2, 4, 3, 3, 2, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 6, 5, 5, 4, 5, 5, 4, 4, 3, 4, 5, 4, 5, 4, 5, 4, 4, 3, 4, 4, 3, 3, 2, 3, 4, 3, 4, 3, 5, 4, 4, 3, 4, 5, 4, 5, 4]