OFFSET
1,2
COMMENTS
In more detail: k students are sitting in a circle. A professor starts tagging them in the pattern - duck, duck, goose, ... . If a student is tagged goose he or she leaves the circle immediately. The last remaining student is the winner. These are the numbers k of initial students such that the n-th student will be the winner.
LINKS
Yunier Bello Cruz and Roy Quintero-Contreras, On the Recurrence Formula for Fixed Points of the Josephus Function, arXiv:2310.12984 [math.CO], 2023. See Table 1 p. 5.
Eric Weisstein's World of Mathematics, Josephus Problem
Wikipedia, Josephus problem
FORMULA
a(n) = A081615(n)-1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Dan Fodor, Apr 30 2012
EXTENSIONS
Name corrected by Hugo Pfoertner, Oct 23 2023
STATUS
approved