cp's OEIS Frontend

A209258 The original Josephus problem: 41 soldiers are arranged in a ring, and every third man is killed by his neighbor, until only the last person remains, who would kill himself. Sequence shows soldier killing order.

%I A209258 #31 Jun 23 2020 08:58:39
%S A209258 3,6,9,12,15,18,21,24,27,30,33,36,39,1,5,10,14,19,23,28,32,37,41,7,13,
%T A209258 20,26,34,40,8,17,29,38,11,25,2,22,4,35,16,31
%N A209258 The original Josephus problem: 41 soldiers are arranged in a ring, and every third man is killed by his neighbor, until only the last person remains, who would kill himself. Sequence shows soldier killing order.
%C A209258 Josephus and another soldier did not agree with that proposal. By choosing positions 31 and 16 in the ring, Josephus and his companion saved their lives.
%C A209258 As a mathematics problem, the classic "Josephus problem" assumes that the soldiers arranged themselves in a circle and counted by threes to determine the order in which they would be killed, and the comment above assumes that Josephus and the one other survivor deliberately placed themselves in the two positions that would make them the last two survivors, but neither of these assumptions is supported by the account of Josephus himself (see the quote at the Links entry). - _Jon E. Schoenfield_, Jun 04 2017
%H A209258 Wikipedia, <a href="http://en.wikipedia.org/wiki/Josephus_problem">Josephus problem</a>.
%H A209258 <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a>
%t A209258 Needs["Combinatorica`"]
%t A209258 InversePermutation@Josephus[41, 3]
%t A209258 lst = {}; r = 41; s = Range[r]; Do[s = RotateLeft[s, 2]; AppendTo[lst, First[s]]; s = Rest[s], {r}]; lst
%Y A209258 Cf. A054995.
%K A209258 easy,fini,full,nonn
%O A209258 1,1
%A A209258 _Arkadiusz Wesolowski_, Jan 14 2013