Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people.
A005427
Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people.
Terms
- a(0) =5a(1) =7a(2) =9a(3) =12a(4) =16a(5) =22a(6) =29a(7) =39a(8) =52a(9) =69a(10) =92a(11) =123a(12) =164a(13) =218a(14) =291a(15) =388a(16) =517a(17) =690a(18) =920a(19) =1226a(20) =1635a(21) =2180a(22) =2907a(23) =3876a(24) =5168a(25) =6890a(26) =9187a(27) =12249a(28) =16332a(29) =21776
External references
- oeis: A005427