login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A208848
Number of non-Josephus subsets of n people.
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 13, 0, 0, 26, 0, 0, 54, 0, 238, 794, 0, 0, 308, 545, 0
OFFSET
0,10
COMMENTS
A non-Josephus subset is a subset of people in the Josephus problem of a circle of n people for which no positive integer k exists which removes all those not in the subset first, by starting the count at person 1 and removing every k-th person clockwise.
REFERENCES
R. L. Graham, D. E. Knuth and O. Patashnik, Exercise 1.26 in Concrete Mathematics, 2nd edition, Addison-Wesley, 1994, pages 26, 501.
EXAMPLE
For n = 9, the a(9) = 3 non-Josephus subsets are {1, 2, 5, 8, 9}, {2, 3, 4, 5, 8} and {2, 5, 6, 7, 8}.
CROSSREFS
Cf. A208849.
Sequence in context: A363033 A321711 A277788 * A277945 A169777 A338464
KEYWORD
nonn,more
AUTHOR
STATUS
approved