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.

A262696 a(n)=0 if n is in A259934, otherwise number of terminal nodes (including n itself if it is a leaf) in that finite subtree whose root is n and whose edge-relation is defined by A049820(child) = parent.

Table of values

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

List of values

[0, 2, 0, 1, 1, 1, 0, 1, 1, 13, 1, 13, 0, 1, 1, 11, 1, 11, 0, 1, 1, 10, 0, 10, 1, 1, 1, 10, 1, 9, 0, 8, 1, 1, 0, 8, 1, 1, 6, 7, 1, 1, 0, 1, 1, 6, 0, 6, 5, 1, 1, 6, 1, 5, 0, 1, 1, 5, 0, 3, 4, 3, 0, 1, 1, 3, 1, 1, 1, 2, 0, 1, 4, 1, 1, 1, 7, 1, 0, 1, 1, 7, 1, 6, 4, 1, 1, 6, 1, 1, 0, 5, 1, 1, 0, 4, 4, 4, 1, 1, 1, 1, 0, 1, 3, 4, 0, 4, 1, 1, 1, 3, 1, 1, 0, 1, 1, 1, 0, 1, 3, 0, 4, 1]