login
Number of Josephus subsets of n people.
1

%I #15 Jun 23 2020 01:22:29

%S 1,2,4,8,16,32,64,128,256,509,1024,2048,4083,8192,16384,32742,65536,

%T 131072,262090,524288,1048338,2096358,4194304,8388608,16776908,

%U 33553887,67108864

%N Number of Josephus subsets of n people.

%C 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.

%H <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a>

%F a(n) = 2^n - A208848(n).

%Y Cf. A208848.

%K nonn,more

%O 0,2

%A _William Rex Marshall_, Mar 07 2012