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.
%I A262679 #9 Oct 04 2015 13:11:49 %S A262679 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, %T A262679 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, %U A262679 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 %N 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. %C A262679 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". %H A262679 Antti Karttunen, <a href="/A262679/b262679.txt">Table of n, a(n) for n = 0..65538</a> %F A262679 If A262693(n) = 1 [i.e., when n is in A259934], then a(n) = n, otherwise a(n) = a(A049820(n)). %o A262679 (Scheme, with memoization-macro definec) %o A262679 (definec (A262679 n) (cond ((= 1 (A262693 n)) n) (else (A262679 (A049820 n))))) %Y A262679 Cf. A000005, A049820, A259934, A262693. %Y A262679 Cf. A262522, A262695, A262696, A262697. %K A262679 nonn %O A262679 0,3 %A A262679 _Antti Karttunen_, Oct 04 2015