Skip to content

A088333

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

offset: 1
codomain: ℕ
n12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879
A08833311221526159159131591317213711151923272610141822263034383711151923273135394347513711151923273135394347515559636726101418222630343842