A386641 -id:A386641 - cp's OEIS frontend

A386643 Elimination order of the first person in a variation of the Josephus problem in which one person is skipped, then one is eliminated, then two people are skipped and one eliminated, then three people are skipped and so on.

1, 2, 3, 2, 3, 4, 5, 3, 7, 9, 5, 7, 4, 10, 6, 13, 16, 18, 5, 17, 10, 22, 22, 8, 17, 6, 21, 15, 27, 18, 16, 18, 23, 7, 12, 35, 35, 36, 28, 13, 15, 37, 8, 21, 30, 16, 37, 26, 30, 41, 23, 19, 9, 28, 33, 13, 28, 44, 50, 35, 60, 58, 53, 10, 47, 61, 41, 37, 26, 34, 70, 15, 66, 34, 50, 11, 55, 19, 70, 70

Offset: 1

Tanya Khovanova, Nathan Sheffield, and the MIT PRIMES STEP junior group, Jul 27 2025

nonn

			Consider 4 people in a circle. Initially, person number 1 is skipped, and person 2 is eliminated. The remaining people are now in order 3, 4, 1. Then, two people are skipped, and person 1 is eliminated, implying that the order of elimination of the first person is 2: a(4) = 2.

The first column of triangle A386639.

Cf. A000096, A225381, A386641.

A386639 Triangle T(n,k) read by rows, where row n is a permutation of the numbers 1 through n, such that if a deck of n cards is prepared in this order, and the AP dealing is used, then the resulting cards will be dealt in increasing order.

Original entry on oeis.org

1, 2, 1, 3, 1, 2, 2, 1, 4, 3, 3, 1, 4, 5, 2, 4, 1, 6, 3, 2, 5, 5, 1, 3, 4, 2, 6, 7, 3, 1, 7, 5, 2, 6, 8, 4, 7, 1, 8, 6, 2, 9, 4, 5, 3, 9, 1, 8, 5, 2, 4, 7, 6, 3, 10, 5, 1, 6, 4, 2, 10, 11, 7, 3, 8, 9, 7, 1, 4, 9, 2, 11, 10, 8, 3, 6, 5, 12, 4, 1, 13, 11, 2, 10, 6, 7, 3, 5, 12, 9, 8, 10, 1, 7, 6, 2, 12, 8, 5, 3, 14

Offset: 1

Tanya Khovanova, Nathan Sheffield, and the MIT PRIMES STEP junior group, Jul 27 2025

The AP dealing is a dealing pattern where x cards are placed at the bottom of the deck, and then the next card is dealt. The number of cards x placed at the bottom changes with every dealt card according to the arithmetic progression 1, 2, 3, and so on. This pattern repeats until all of the cards have been dealt.
This card dealing can equivalently be seen as a variation on the Josephus problem, where one person is skipped, then the next person is eliminated, then two people are skipped and one person is eliminated, then three people are skipped, and so on. T(n,k) is the order of elimination of the k-th person in the Josephus problem. Equivalently, each row of T is the inverse permutation of the corresponding row of the Josephus triangle A386641, i.e., A386641(n,T(n,k)) = k.
The total number of moves for row n is A000096.
The first column is A386643(n), the order of elimination of the first person in the Josephus problem.
The index of the largest number in row n is A291317(n), corresponding to the index of the freed person in the corresponding Josephus problem.

			Consider a deck of four cards arranged in the order 2,1,4,3. We put one card under and deal the next card, which is card number 1. Now the deck is ordered 4,3,2. We place 2 cards under and deal the next one, which is card number 2. Now the deck is 4,3. Again, placing 3 cards under and dealing the next, we will deal card number 3, leaving card number 4 to be dealt last. The dealt cards are in order. Thus, the fourth row of the triangle is 2,1,4,3.
The triangle begins as follows:
  1;
  2, 1;
  3, 1, 2;
  2, 1, 4, 3;
  3, 1, 4, 5, 2;
  4, 1, 6, 3, 2, 5;
  5, 1, 3, 4, 2, 6, 7;
  3, 1, 7, 5, 2, 6, 8, 4;
  7, 1, 8, 6, 2, 9, 4, 5, 3;

Cf. A000096, A291317, A386641, A386643.

Cf. A378635 (classical elimination process).

T(n,A000096(k)) = k, for A000096(k) <= n.

cp's OEIS Frontend

A386643 Elimination order of the first person in a variation of the Josephus problem in which one person is skipped, then one is eliminated, then two people are skipped and one eliminated, then three people are skipped and so on.

Views

Author

Keywords

Examples

Crossrefs