A321794 Josephus problem: Positions of records in the rows of A321781.

2, 1, 4, 5, 6, 1, 2, 4, 2, 4, 4, 7, 3, 3, 5, 14, 13, 8, 14, 18, 4, 5, 19, 10, 11, 10, 13, 25, 2, 21, 18, 19, 15, 10, 11, 15, 4, 39, 23, 33, 33, 39, 28, 4, 34, 32, 8, 32, 18, 12, 26, 53, 10, 11, 22, 33, 26, 3, 54, 42, 14, 39, 18, 59, 66, 6, 50, 61, 23, 69, 8, 59, 3, 21

Offset

2,1

Comments

a(n) gives the initial position j of a person in the Josephus problem such that the largest minimal elimination parameter q, meaning every q-th person being executed, is needed among all initial positions 1 <= j <= n, to make position a(n) survive. The corresponding value of q is given by A321793.

Links

Hugo Pfoertner, Table of n, a(n) for n = 2..400

Index entries for sequences related to the Josephus Problem

Crossrefs

Cf. A321781, A321793.

Sequence in context: A323955 A197011 A326060 * A075423 A144774 A326056

Adjacent sequences: A321791 A321792 A321793 * A321795 A321796 A321797

Keyword

nonn

Author

Hugo Pfoertner, Nov 19 2018

Status

approved