A300868 Lexicographically earliest sequence of distinct positive terms such that, for any n > 0, n * a(n) is a Fibbinary number (A003714).
1, 2, 3, 4, 8, 6, 12, 5, 9, 13, 15, 7, 10, 19, 11, 16, 17, 18, 14, 26, 32, 24, 23, 22, 41, 20, 38, 39, 36, 43, 44, 21, 33, 34, 59, 29, 64, 27, 28, 52, 25, 49, 30, 31, 53, 46, 47, 48, 42, 82, 51, 40, 45, 76, 96, 78, 72, 73, 35, 71, 84, 75, 86, 37, 65, 66, 70
Offset: 1
Examples
The first terms, alongside the binary representation of n * a(n), are: n a(n) binary(n * a(n)) -- ---- ---------------- 1 1 1 2 2 100 3 3 1001 4 4 10000 5 8 101000 6 6 100100 7 12 1010100 8 5 101000 9 9 1010001 10 13 10000010 11 15 10100101 12 7 1010100 13 10 10000010 14 19 100001010 15 11 10100101 16 16 100000000 17 17 100100001 18 18 101000100 19 14 100001010 20 26 1000001000
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..10000
- Index entries for sequences that are permutations of the natural numbers
- Rémy Sigrist, Colored logarithmic scatterplot of the first 2^15 terms (where the color is function of A070939(n * a(n)))
- Rémy Sigrist, C++ program for A300868
Comments