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”).

A208849
Number of Josephus subsets of n people.
1
1, 2, 4, 8, 16, 32, 64, 128, 256, 509, 1024, 2048, 4083, 8192, 16384, 32742, 65536, 131072, 262090, 524288, 1048338, 2096358, 4194304, 8388608, 16776908, 33553887, 67108864
OFFSET
0,2
COMMENTS
A Josephus subset is a subset of people in the Josephus problem of a circle of n people for which some 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.
FORMULA
a(n) = 2^n - A208848(n).
CROSSREFS
Cf. A208848.
Sequence in context: A097000 A285894 A271481 * A054046 A008861 A145115
KEYWORD
nonn,more
AUTHOR
STATUS
approved