A358875 -id:A358875 - cp's OEIS frontend

A358876 Inverse to A358875.

1, 2, 3, 4, 5, 7, 11, 16, 6, 12, 8, 22, 29, 37, 46, 56, 9, 30, 38, 67, 23, 79, 92, 106, 17, 121, 137, 154, 172, 191, 211, 232, 10, 47, 31, 173, 68, 138, 122, 254, 80, 93, 277, 301, 326, 352, 379, 407, 13, 436, 466, 497, 529, 562, 596, 631, 667, 704, 742, 781

Offset: 0

Rémy Sigrist, Dec 04 2022

			A358875(38) = 18, so a(18) = 38.

Rémy Sigrist, Table of n, a(n) for n = 0..10000
Rémy Sigrist, PARI program
Index entries for sequences that are permutations of the natural numbers

Cf. A358874, A358875.

PARI
```
See Links section.
```

a(2^k) < a(n) if 2^k < n.

A386932 Lexicographically earliest sequence of distinct positive integers that can be partitioned into runs of integers without common bits, the n-th such run having a(n) terms.

Original entry on oeis.org

1, 2, 4, 3, 8, 16, 32, 5, 10, 48, 6, 9, 64, 128, 256, 512, 1024, 2048, 7, 24, 96, 384, 1536, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 11, 20, 160, 320, 2560, 5120, 24576, 98304, 393216, 1572864, 6291456, 8388608

Offset: 1

Rémy Sigrist, Aug 09 2025

This sequence is a permutation of the positive integers as each run starts with the least integer not yet in the sequence.

The powers of two appear in natural order.

			The first terms and runs are:
  n  a(n)  n-th run
  -  ----  -----------------------------------
  1     1  1
  2     2  2, 4
  3     4  3, 8, 16, 32
  4     3  5, 10, 48
  5     8  6, 9, 64, 128, 256, 512, 1024, 2048

Rémy Sigrist, Table of n, a(n) for n = 1..6223
Rémy Sigrist, Logarithmic scatterplot of the first 10319 terms (where red pixels correspond to powers of 2)
Rémy Sigrist, PARI program
Index entries for sequences that are permutations of the natural numbers

See A385661 for a similar sequence.

Cf. A358875, A387024 (inverse).

PARI
```
\\ See Links section.
```

cp's OEIS Frontend

A358876 Inverse to A358875.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

Formula