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.

A262695 a(n)=0 if n is in A259934, otherwise 1 + number of steps to reach the farthest leaf in that finite branch of the tree defined by edge-relation A049820(child) = parent.

Table of values

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

List of values

[0, 4, 0, 3, 2, 2, 0, 1, 1, 24, 3, 23, 0, 1, 2, 22, 2, 21, 0, 1, 1, 20, 0, 19, 1, 1, 3, 18, 1, 17, 0, 16, 2, 1, 0, 15, 1, 1, 10, 14, 1, 2, 0, 1, 2, 13, 0, 12, 9, 1, 1, 11, 1, 10, 0, 1, 1, 9, 0, 8, 8, 7, 0, 1, 1, 6, 1, 1, 1, 5, 0, 4, 7, 3, 1, 1, 13, 2, 0, 1, 2, 12, 4, 11, 6, 1, 3, 10, 1, 5, 0, 9, 2, 4, 0, 8, 5, 7, 1, 3, 1, 2, 0, 1, 4, 6, 0, 5, 1, 1, 2, 4, 1, 1, 0, 3, 1, 1, 0, 2, 3]