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.