%I #14 Jun 25 2020 14:22:36
%S 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
%N Number of non-Josephus subsets of n people.
%C 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.
%D R. L. Graham, D. E. Knuth and O. Patashnik, Exercise 1.26 in Concrete Mathematics, 2nd edition, Addison-Wesley, 1994, pages 26, 501.
%H <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a>
%e 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}.
%Y Cf. A208849.
%K nonn,more
%O 0,10
%A _William Rex Marshall_, Mar 07 2012