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.

A262679 a(n) = largest k in A259934 which is an ancestor of n in a tree generated by edge-relation A049820(child) = parent. If n is itself in A259934, then a(n) = n.

Table of values

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

List of values

[0, 0, 2, 0, 0, 0, 6, 0, 0, 6, 6, 6, 12, 6, 6, 6, 6, 6, 18, 6, 6, 6, 22, 6, 6, 22, 22, 6, 22, 6, 30, 6, 22, 6, 34, 6, 6, 6, 34, 6, 22, 6, 42, 6, 34, 6, 46, 6, 34, 46, 34, 6, 46, 6, 54, 6, 34, 6, 58, 6, 34, 6, 62, 6, 6, 6, 58, 6, 62, 6, 70, 6, 34, 6, 70, 6, 70, 6, 78, 6, 70, 70, 78, 70, 34, 70, 78, 70, 70, 70, 90, 70, 78, 70, 94, 70, 34, 70, 78, 70, 70, 70, 102, 70, 34, 70, 106, 70, 34, 70, 102, 70, 102, 70, 114, 70, 102, 70, 118, 70, 34, 121, 118, 70]