A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer 3 places clockwise from i. Repeat, counting 3 places from the next undeleted integer, until only one integer remains.
A088333
A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer 3 places clockwise from i. Repeat, counting 3 places from the next undeleted integer, until only one integer remains.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =2a(4) =1a(5) =5a(6) =2a(7) =6a(8) =1a(9) =5a(10) =9a(11) =1a(12) =5a(13) =9a(14) =13a(15) =1a(16) =5a(17) =9a(18) =13a(19) =17a(20) =21a(21) =3a(22) =7a(23) =11a(24) =15a(25) =19a(26) =23a(27) =27a(28) =2a(29) =6
External references
- oeis: A088333