Skip to content

A054995

OEIS Lean4

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.

offset: 1
codomain: ℕ
n123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
A054995122141471471013258111417202581114172023262914710131619222528313437404346258111417202326293235384144475053565962656814710131619222528313437404346495255586164677073767982858891