%I #10 Oct 11 2015 10:51:42
%S 2,12,18,30,42,54,90,94,106,121,190,194,210,236,242,254,298,302,342,
%T 346,354,366,374,390,410,426,442,466,494,530,546,558,562,566,574,606,
%U 650,658,710,716,730,746,914,942,986,1030,1038,1042,1052,1058,1090,1114,1134,1146,1240,1250,1266,1278,1286,1310,1354,1370,1378,1418,1426,1450,1454,1490,1562,1650,1662,1670,1676,1694,1706
%N Nonbranching nodes in the infinite trunk (A259934) of the tree generated by edge-relation A049820(child) = parent: a(n) = A259934(A262892(n)).
%C Equally, numbers n for which A060990(n)*A262693(n) = 1, thus an intersection of A262511 and A259934.
%C The next odd term after a(10) = 121 occurs at a(3372) = 113569.
%H Antti Karttunen, <a href="/A262897/b262897.txt">Table of n, a(n) for n = 1..4085</a>
%F a(n) = A259934(A262892(n)).
%o (Scheme, two alternatives; macro MATCHING-POS can be found from _Antti Karttunen_'s IntSeq-library)
%o (define (A262897 n) (A259934 (A262892 n)))
%o (define A262897 (MATCHING-POS 1 0 (lambda (n) (and (= 1 (A060990 n)) (= 1 (A262693 n))))))
%Y Cf. A000005, A049820, A060990, A259934, A262511, A262693, A262892, A262896.
%Y Cf. A262510 (a subsequence).
%K nonn
%O 1,1
%A _Antti Karttunen_, Oct 06 2015