Skip to content

A181281

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 4 places clockwise from i. Repeat, counting 4 places from the next undeleted integer, until only one integer remains.

offset: 1
codomain: ℕ
n1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980
A18128112122163838161116111627121722381318232838131823283316111621263136414649141924293439444954161116212631364146515661667138131823283338