login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A321794 Josephus problem: Positions of records in the rows of A321781. 3
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 06:13 EDT 2021. Contains 347623 sequences. (Running on oeis4.)