login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269366 a(1) = 1, a(2n) = A269361(1+a(n)), a(2n+1) = A269363(a(n)). 5

%I #18 Dec 10 2019 12:10:10

%S 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,

%T 27,17,19,25,44,29,28,50,75,21,30,72,71,73,70,133,139,113,76,129,91,

%U 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

%N a(1) = 1, a(2n) = A269361(1+a(n)), a(2n+1) = A269363(a(n)).

%C 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:

%C |

%C ...................1...................

%C 2 3

%C 4......../ \........6 5......../ \........7

%C / \ / \ / \ / \

%C / \ / \ / \ / \

%C / \ / \ / \ / \

%C 8 12 16 15 9 11 10 22

%C 13 24 18 38 40 48 33 46 20 14 32 27 17 19 25 44

%C etc.

%C An example of (suspected) "entanglement permutation" where the other pair of complementary sequences is generated by a greedy algorithm.

%C 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.

%H Antti Karttunen, <a href="/A269366/b269366.txt">Table of n, a(n) for n = 1..8192</a>

%H Antti Karttunen, <a href="/A135141/a135141.pdf">Entanglement Permutations</a>, 2016-2017

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%o (Scheme, with defineperm1-macro from _Antti Karttunen_'s IntSeq-library)

%o (defineperm1 (A269366 n) (cond ((= 1 n) n) ((even? n) (A269361 (+ 1 (A269366 (/ n 2))))) (else (A269363 (A269366 (/ (- n 1) 2))))))

%o (define (A269365 n) (A269366 (- n))) ;; The negative side gives the values for the inverse function (from the cache).

%o ;; We consider a > b (i.e. not less than b) also in case a is #f.

%o ;; (Because of the stateful caching system used by defineperm1-macro):

%o (define (not-lte? a b) (cond ((not (number? a)) #t) (else (> a b))))

%Y Left inverse: A269365 (also right inverse, if this sequence is a permutation of natural numbers).

%Y Cf. A091067, A091072, A269361, A269363, A269367, A266121.

%K nonn,look,tabf

%O 1,2

%A _Antti Karttunen_, Feb 25 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)