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.

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

Table of values

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

List of values

[0, 6, 0, 3, 2, 2, 0, 1, 1, 38, 3, 37, 0, 1, 2, 33, 2, 32, 0, 1, 1, 30, 0, 29, 1, 1, 3, 28, 1, 26, 0, 24, 2, 1, 0, 23, 1, 1, 16, 21, 1, 2, 0, 1, 2, 18, 0, 17, 13, 1, 1, 16, 1, 14, 0, 1, 1, 13, 0, 10, 11, 9, 0, 1, 1, 8, 1, 1, 1, 6, 0, 4, 10, 3, 1, 1, 23, 2, 0, 1, 2, 22, 4, 20, 9, 1, 3, 19, 1, 5, 0, 13, 2, 4, 0, 11, 8, 10, 1, 3, 1, 2, 0, 1, 6, 9, 0, 8, 1, 1, 2, 6, 1, 1, 0, 3, 1, 1, 0, 2, 5, 0, 12, 1]