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.

A262904 If n = A259934(k) then a(n) = k, otherwise largest k such that A259934(k) is an ancestor of n in a tree generated by edge-relation A049820(child) = parent.

Table of values

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

List of values

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