A321793 Josephus problem: Records in the rows of A321781.

3, 5, 10, 11, 27, 11, 19, 42, 19, 40, 26, 23, 47, 62, 45, 56, 92, 55, 86, 74, 62, 67, 85, 65, 85, 169, 119, 105, 153, 90, 94, 150, 139, 144, 175, 171, 119, 131, 178, 161, 187, 234, 301, 203, 206, 226, 173, 217, 406, 178, 216, 164, 372, 208, 341, 175, 281, 234, 301, 322, 252, 339

Offset

2,1

Comments

For a given initial position j among the n persons in the Josephus problem, there exists a smallest elimination parameter q, meaning every q-th person being executed, by which position j can be made to survive. a(n) gives the maximum of q taken over all initial positions 1 <= j <= n. The value of j, for which the maximum q occurs, is given by A321794.

Links

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

Index entries for sequences related to the Josephus Problem

Crossrefs

Cf. A006257, A321781, A321794.

Sequence in context: A326419 A102309 A067230 * A075741 A119133 A284959

Adjacent sequences: A321790 A321791 A321792 * A321794 A321795 A321796

Keyword

nonn

Author

Hugo Pfoertner, Nov 19 2018

Status

approved