|
|
|
|
1, 2, 3, 4, 6, 5, 7, 8, 12, 16, 15, 9, 11, 10, 22, 13, 24, 18, 38, 40, 48, 33, 46, 20, 14, 32, 27, 17, 19, 25, 44, 29, 28, 50, 75, 21, 30, 72, 71, 73, 70, 133, 139, 113, 76, 129, 91, 42, 35, 36, 23, 37, 54, 45, 51, 26, 43, 49, 39, 82, 62, 128, 107, 80, 56, 53, 83, 114, 140, 109, 214, 52, 59, 34, 47, 149, 150, 141, 123, 221, 111, 121
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence can be represented as a binary tree. Each left hand child is produced as A269361(1+n), and each right hand child as A269363(n), when the parent node contains n:
|
...................1...................
2 3
4......../ \........6 5......../ \........7
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
8 12 16 15 9 11 10 22
13 24 18 38 40 48 33 46 20 14 32 27 17 19 25 44
etc.
An example of (suspected) "entanglement permutation" where the other pair of complementary sequences is generated by a greedy algorithm.
Sequence is not only injective, but also surjective on N (thus a permutation of natural numbers) provided that A269361 is surjective on A091072 and A269363 is surjective on A091067.
|
|
LINKS
|
|
|
PROG
|
(define (A269365 n) (A269366 (- n))) ;; The negative side gives the values for the inverse function (from the cache).
;; We consider a > b (i.e. not less than b) also in case a is #f.
;; (Because of the stateful caching system used by defineperm1-macro):
(define (not-lte? a b) (cond ((not (number? a)) #t) (else (> a b))))
|
|
CROSSREFS
|
Left inverse: A269365 (also right inverse, if this sequence is a permutation of natural numbers).
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|