|
|
A244154
|
|
Permutation of natural numbers: a(0) = 1, a(1) = 2, a(2n) = A254049(a(n)), a(2n+1) = 3*a(n)-1; composition of A048673 and A005940.
|
|
21
|
|
|
1, 2, 3, 5, 4, 8, 13, 14, 6, 11, 18, 23, 25, 38, 63, 41, 7, 17, 28, 32, 39, 53, 88, 68, 61, 74, 123, 113, 172, 188, 313, 122, 9, 20, 33, 50, 46, 83, 138, 95, 72, 116, 193, 158, 270, 263, 438, 203, 85, 182, 303, 221, 424, 368, 613, 338, 666, 515, 858, 563, 1201, 938, 1563, 365, 10, 26, 43, 59, 60
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Note the indexing: the domain starts from 0, while the range excludes zero.
This sequence can be represented as a binary tree. Each left hand child is obtained by applying A254049(n) when the parent contains n, and each right hand child is obtained by applying A016789(n-1) (i.e., multiply by 3, subtract one) to the parent's contents:
1
|
...................2...................
3 5
4......../ \........8 13......../ \........14
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
6 11 18 23 25 38 63 41
7 17 28 32 39 53 88 68 61 74 123 113 172 188 313 122
etc.
This is a mirror image of the tree depicted in A245612.
(End)
|
|
LINKS
|
|
|
FORMULA
|
a(0) = 1, a(1) = 2, a(2n) = A254049(a(n)), a(2n+1) = 3*a(n)-1.
(End)
|
|
PROG
|
(Scheme)
;; Implementing a new recurrence, with memoization-macro definec:
|
|
CROSSREFS
|
Cf. A005940, A048673, A054429, A243065-A243066, A243505-A243506, A245608, A245610, A245612, A016789, A254049, A285712, A285714, A286613.
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|