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 two places clockwise from i. Repeat, counting two places from the next undeleted integer, until only one integer remains.
A054995
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 two places clockwise from i. Repeat, counting two places from the next undeleted integer, until only one integer remains.
Terms
- a(0) =1a(1) =2a(2) =2a(3) =1a(4) =4a(5) =1a(6) =4a(7) =7a(8) =1a(9) =4a(10) =7a(11) =10a(12) =13a(13) =2a(14) =5a(15) =8a(16) =11a(17) =14a(18) =17a(19) =20a(20) =2a(21) =5a(22) =8a(23) =11a(24) =14a(25) =17a(26) =20a(27) =23a(28) =26a(29) =29
External references
- oeis: A054995