|
%I #9 Oct 02 2015 12:23:17
%S 1,2,3,4,5,9,6,12,7,16,8,25,14,18,10,32,19,20,11,45,26,24,13,66,38,42,
%T 22,49,29,28,15,81,53,50,31,52,33,30,17,121,73,68,39,64,37,40,21,175,
%U 106,104,61,114,69,56,35,135,82,76,46,75,43,44,23,231,129,147,86,136,83,80,51,144,85,88,55,78,47,48,27,338,197,190,118,182,108,105,62,172,101,102,60,110,65,54,34
%N Permutation of natural numbers: a(1) = 1; thereafter a(2n) = A182859(1+a(n)), a(2n+1) = A080218(a(n)).
%C This sequence can be represented as a binary tree. For each node containing n, the left hand child is obtained as A182859(1+n), and the right hand child as A080218(n):
%C 1
%C |
%C ................../ \..................
%C 2 3
%C 4......../ \........5 9......../ \........6
%C / \ / \ / \ / \
%C / \ / \ / \ / \
%C / \ / \ / \ / \
%C 12 7 16 8 25 14 18 10
%C 32 19 20 11 45 26 24 13 66 38 42 22 49 29 28 15
%C etc.
%H Antti Karttunen, <a href="/A262692/b262692.txt">Table of n, a(n) for n = 1..4095</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F a(1) = 1; thereafter a(2n) = A182859(1+a(n)), a(2n+1) = A080218(a(n)).
%o (Scheme, with memoization-macro definec)
%o (definec (A262692 n) (cond ((<= n 1) n) ((even? n) (A182859 (+ 1 (A262692 (/ n 2))))) (else (A080218 (A262692 (/ (- n 1) 2))))))
%Y Inverse: A262691.
%Y Cf. A080218, A182859.
%K nonn,tabf
%O 1,2
%A _Antti Karttunen_, Sep 28 2015
|
