Triangle of second-to-last man to survive in Josephus problem of n men in a circle with every k-th killed, with 1 <= k <= n and n >= 2.
A032435
Triangle of second-to-last man to survive in Josephus problem of n men in a circle with every k-th killed, with 1 <= k <= n and n >= 2.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =1a(5) =3a(6) =1a(7) =1a(8) =2a(9) =4a(10) =3a(11) =2a(12) =1a(13) =2a(14) =5a(15) =1a(16) =1a(17) =5a(18) =1a(19) =4a(20) =6a(21) =3a(22) =1a(23) =2a(24) =1a(25) =3a(26) =4a(27) =7a(28) =1a(29) =4
External references
- oeis: A032435