A269365 -id:A269365 - cp's OEIS frontend

A266121 Lexicographically first injection of natural numbers beginning with a(1)=1 such that 1+(a(n)*a(n+1)) is a fibbinary number (A003714), i.e., has no adjacent 1's in its base-2 representation.

1, 3, 5, 4, 2, 8, 9, 7, 12, 6, 14, 24, 11, 13, 20, 16, 10, 26, 40, 17, 15, 39, 28, 19, 27, 25, 23, 48, 22, 30, 44, 31, 33, 32, 18, 36, 29, 47, 45, 52, 21, 55, 49, 84, 61, 43, 51, 53, 80, 34, 64, 37, 35, 59, 75, 117, 93, 91, 57, 41, 100, 82, 50, 104, 42, 98, 106, 90, 114, 72, 58, 144, 65, 63, 151, 56, 38, 54, 76, 71, 60

Offset: 1

Antti Karttunen, Dec 23 2015

It is conjectured that this sequence is not only injective, but also surjective on N, i.e., that it is a true permutation of natural numbers.
A similar sequence, but with condition that "(a(n)*a(n+1)) must be a member of A003714" yields a sequence: 1, 2, 4, 5, 8, 9, 16, 10, 13, 20, ... (A269361) which certainly is not a bijection, because it contains only terms of A091072.
Also, with above condition and the initial value a(1) = 3 the algorithm generates A269363 which contains only terms of A091067. See also A266191.

			After the initial a(1) = 1, for obtaining the value of a(2) we try the first unused number, which is 2, but (1*2)+1 = 3, which in binary is "11", thus 2 is not qualified at this point of time. So next we try 3, and (1*3)+1 = 4, which in binary is "100", and that satisfies our criterion (no adjacent 1-bits), thus we set a(2) = 3.
For a(3), we test with the least unused numbers 2, 4, 5, etc., yielding products (3*2)+1 = 7 = "111", (3*4)+1 = 13 = "1101" and (3*5)+1 = 16 = "10000" in binary, and only 5 satisfies the criterion, thus we set a(3) = 5.

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences that are permutations of the natural numbers

Left inverse: A266122 (also the right inverse if this sequence is a permutation of natural numbers).
Cf. A003714, A003987, A091067, A091072, A269361, A269363, A269365, A269366, A269367.
Cf. also A266191 and A266117 for similar permutations.

Minor typo in the description corrected by Antti Karttunen, Feb 25 2016

A269361 Lexicographically first injection of natural numbers beginning with a(1)=1 such that a(n)*a(n+1) is a fibbinary number (A003714), i.e., has no adjacent 1's in its base-2 representation.

Original entry on oeis.org

1, 2, 4, 5, 8, 9, 16, 10, 13, 20, 17, 32, 18, 29, 36, 33, 40, 26, 21, 49, 42, 52, 25, 41, 50, 82, 57, 45, 53, 80, 34, 64, 37, 113, 74, 125, 84, 61, 72, 58, 73, 65, 68, 69, 128, 66, 129, 132, 133, 77, 114, 81, 117, 90, 104, 85, 98, 89, 93, 100, 105, 161, 106, 97, 169, 122, 137, 157, 138, 136, 121, 141, 149, 221, 153, 109, 160, 116, 144

Offset: 1

Antti Karttunen, Feb 25 2016

The sequence is conjectured to be a permutation of A091072.

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A003714, A091072, A266121, A266191, A269363, A269365, A269366.

A269363 Lexicographically first injection of natural numbers beginning with a(1)=3 such that for all n >= 1, a(n)*a(n+1) is a fibbinary number (A003714), i.e., has no adjacent 1's in its base-2 representation.

Original entry on oeis.org

3, 6, 7, 12, 11, 15, 22, 24, 14, 19, 27, 38, 28, 23, 46, 48, 43, 30, 39, 35, 59, 44, 31, 75, 62, 87, 51, 83, 56, 47, 88, 54, 76, 55, 96, 86, 60, 71, 67, 70, 78, 112, 79, 107, 102, 91, 120, 139, 118, 140, 119, 142, 131, 134, 155, 240, 156, 135, 152, 108, 95, 92, 103, 179, 184, 115, 147, 224, 94, 175, 123, 150, 111, 158, 214, 163, 203

Offset: 1

Antti Karttunen, Feb 25 2016

The sequence is conjectured to be a permutation of A091067.

The scatter plot is quite interesting (essentially the same as A269367). Compare also to the graph of A269361.

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A003714, A003987, A091067, A266121, A266191, A269361, A269365, A269366.

Cf. A269367 (the terms ranked with A255070).

fibbinaryQ[n_] := BitAnd[n, 2 n]==0; a[1]=3; a[n_] := a[n] = For[k=1, True, k++, If[Mod[k, 4] != 1, If[fibbinaryQ[a[n-1] k], If[FreeQ[Array[a, n-1], k], Return[k]]]]]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Mar 02 2016 *)

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

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Feb 25 2016

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.

Antti Karttunen, Table of n, a(n) for n = 1..8192
Antti Karttunen, Entanglement Permutations, 2016-2017
Index entries for sequences that are permutations of the natural numbers

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

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

cp's OEIS Frontend

A266121 Lexicographically first injection of natural numbers beginning with a(1)=1 such that 1+(a(n)*a(n+1)) is a fibbinary number (A003714), i.e., has no adjacent 1's in its base-2 representation.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A269361 Lexicographically first injection of natural numbers beginning with a(1)=1 such that a(n)*a(n+1) is a fibbinary number (A003714), i.e., has no adjacent 1's in its base-2 representation.

Views

Author

Keywords

Comments

Links

Crossrefs

A269363 Lexicographically first injection of natural numbers beginning with a(1)=3 such that for all n >= 1, a(n)*a(n+1) is a fibbinary number (A003714), i.e., has no adjacent 1's in its base-2 representation.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Links

Crossrefs