%I
%S 119139,119143,119147,119213,119225,119919,119921,120073,120091,
%T 120095,120097,120277,120291,120347,120391,120703,120739,120883,
%U 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 Parent nodes of nonzero terms of A262509: a(n) = A049820(A262509(n)).
%C These numbers are one step nearer (than those of A262509) to the root (zero) of the tree where the parentchild 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 Antti Karttunen, <a href="/A262510/b262510.txt">Table of n, a(n) for n = 1..68</a>
%F a(n) = A049820(A262509(n)).
%F a(n) = A259934(A262508(n)1).
%o (Scheme) (define (A262510 n) (A049820 (A262509 n)))
%Y Cf. A049820, A262508, A262509.
%Y Subsequence of A259934 and A262511.
%Y Also a subsequence of A262517 (provided all terms are odd).
%K nonn
%O 1,1
%A _Antti Karttunen_, Sep 25 2015
