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.

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

Offset: 0

Author

Antti Karttunen, Oct 04 2015

Keywords

• nonn

Comments

For the terms outside of A259934 the condition "largest k in A259934 which is an ancestor of n" is equivalent to the condition "nearest ancestor in A259934".

Links

• Antti Karttunen, Table of n, a(n) for n = 0..65538

Crossrefs

Cf. A000005, A049820, A259934, A262693.

Cf. A262522, A262695, A262696, A262697.

Formula

If A262693(n) = 1 [i.e., when n is in A259934], then a(n) = n, otherwise a(n) = a(A049820(n)).