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 A262902 #16 Oct 11 2015 10:53:45 %S A262902 5,4,11,17,14,16,22,22,29,27,35,32,41,46,44,46,51,48,57,57,58,65,62, %T A262902 70,69,77,81,80,92,91,101,96,107,102,111,110,111,119,118,114,129,120, %U A262902 129,130,128,128,139,141,138,147,144,155,148,161,158,165,152,162,166,169,162,176,181,191,187,199,192,201,214,215,222,216,227,224,231,239,238,238,249,234,249,247,255,255 %N A262902 a(n) = A049820(A045765(n)); parent-nodes of the leaves of the tree generated by edge-relation A049820(child) = parent. %C A262902 The sequence is computed for each leaf of the tree (A045765), ordered by their magnitude, and it contains duplicates. %H A262902 Antti Karttunen, <a href="/A262902/b262902.txt">Table of n, a(n) for n = 1..10000</a> %F A262902 a(n) = A049820(A045765(n)). %o A262902 (Scheme) (define (A262902 n) (A049820 (A045765 n))) %Y A262902 Row 2 of A262898. %Y A262902 Cf. A262901 (same sequence sorted into ascending order, with duplicates removed). %Y A262902 Cf. A049820, A045765. %Y A262902 Cf. also A257507. %K A262902 nonn %O A262902 1,1 %A A262902 _Antti Karttunen_, Oct 06 2015