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 A262510 #14 Oct 02 2015 12:20:00 %S A262510 119139,119143,119147,119213,119225,119919,119921,120073,120091, %T A262510 120095,120097,120277,120291,120347,120391,120703,120739,120883, %U A262510 120891,120895,120915,120917,121435,121543,121819,122075,122257,122261,122271,122273,122809,122953,123197,123205,123219,123231,123251,123749,24660527,24660543,24662309,24662321,24663755,24664989,24665019,24665347,24665929,24665977,24669139,24669833 %N A262510 Parent nodes of nonzero terms of A262509: a(n) = A049820(A262509(n)). %C A262510 These numbers are one step nearer (than those of A262509) to the root (zero) of the tree where the parent-child relation is given by A049820(child) = parent. Like the terms of A262509, they are also vertices in the infinite trunk of that tree. Cf. A259934. %H A262510 Antti Karttunen, <a href="/A262510/b262510.txt">Table of n, a(n) for n = 1..68</a> %F A262510 a(n) = A049820(A262509(n)). %F A262510 a(n) = A259934(A262508(n)-1). %o A262510 (Scheme) (define (A262510 n) (A049820 (A262509 n))) %Y A262510 Cf. A049820, A262508, A262509. %Y A262510 Subsequence of A259934 and A262511. %Y A262510 Also a subsequence of A262517 (provided all terms are odd). %K A262510 nonn %O A262510 1,1 %A A262510 _Antti Karttunen_, Sep 25 2015