A101267 -id:A101267 - cp's OEIS frontend

A101283 Inverse permutation to sequence A101267.

1, 2, 4, 3, 8, 7, 5, 16, 6, 15, 13, 32, 9, 14, 10, 31, 12, 29, 11, 64, 25, 30, 26, 17, 63, 28, 18, 61, 20, 27, 128, 19, 24, 57, 23, 62, 21, 58, 49, 22, 127, 60, 50, 33, 125, 52, 59, 256, 34, 51, 56, 36, 121, 55, 126, 35, 40, 53, 39, 122, 113, 37, 48, 54, 255, 47, 38, 124, 45

Offset: 1

Leroy Quet, Dec 20 2004

Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, PARI program

Cf. A101267.

PARI
```
See Links section.
```

More terms from David Wasserman, Mar 11 2008

A119474 a(2^m + k) = a(k)-th integer among those positive integers not occurring earlier in the sequence, where m >= 0, 1 <= k<= 2^m. a(1) = 1.

Original entry on oeis.org

1, 2, 3, 5, 4, 7, 9, 12, 6, 10, 13, 16, 15, 20, 23, 27, 8, 14, 18, 22, 21, 28, 31, 35, 26, 34, 39, 43, 42, 49, 53, 58, 11, 19, 25, 32, 30, 38, 44, 48, 37, 47, 54, 59, 57, 65, 69, 74, 45, 60, 66, 72, 71, 81, 85, 90, 79, 91, 97, 102, 101, 110, 115, 121, 17, 29, 36, 46, 41, 55, 62

Offset: 1

Leroy Quet, May 22 2006

Sequence is a permutation of the positive integers.

			8 = 2^2 +4. So since k = 4, we want the a(4)th = 5th positive integer from the sequence 6,8,10,11,12,13,..., i.e., from the sequence of positive integers not occurring among the first 7 terms of {a(k)}. So a(8) = 12.

Ivan Neretin, Table of n, a(n) for n = 1..8192

Cf. A101267, A119475.

a = {1}; Do[AppendTo[a, Complement[Range[Max[a] + (d = a[[i - 2^Floor[Log2[i - 1]]]])], a][[d]]], {i, 2, 71}]; a (* Ivan Neretin, May 03 2015 *)

More terms from Joshua Zucker, Jul 04 2006

cp's OEIS Frontend

A101283 Inverse permutation to sequence A101267.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Extensions