login
4

%I #12 Aug 12 2019 22:37:57

%S 0,0,1,1,2,3,3,2,4,4,7,9,6,6,19,10,8,12,9,7,10,5,5,19,12,8,13,13,22,

%T 27,21,18,64,28,23,36,18,21,55,11,20,57,57,24,58,37,25,30,24,15,73,31,

%U 26,39,27,22,28,16,11,64,30,23,31,14,16,55,15,20,46,46,17,58,36,25,37,17,14,73,39,26,40,40

%N a(n) = A263273(A004526(A263273(n))).

%C When permutation A263273 is viewed as a binary tree, a(n) gives the parent node of node containing n, for all n >= 1.

%C Each n occurs exactly twice in the sequence.

%H Antti Karttunen, <a href="/A265339/b265339.txt">Table of n, a(n) for n = 0..16384</a>

%F a(n) = A263273(A004526(A263273(n))).

%o (Scheme) (define (A265339 n) (A263273 (A004526 (A263273 n))))

%Y Cf. A004526, A263273, A265340.

%K nonn,base,look

%O 0,5

%A _Antti Karttunen_, Dec 18 2015