A088443 A linear version of the Josephus problem: a(n) = the function w_3(n).

1, 2, 1, 4, 1, 1, 7, 8, 8, 1, 2, 1, 2, 5, 14, 14, 17, 17, 17, 17, 14, 2, 1, 4, 1, 1, 2, 4, 4, 5, 11, 32, 31, 34, 31, 31, 37, 38, 38, 38, 41, 37, 38, 37, 38, 31, 31, 1, 4, 5, 1, 7, 8, 8, 1, 2, 1, 2, 5, 4, 1, 8, 8, 8, 8, 11, 11, 20, 23, 25, 71, 71, 68, 70, 68, 76, 74, 68, 68, 68, 70, 82, 83, 82

Offset: 1

Author

N. J. A. Sloane, Nov 09 2003

Keywords

• nonn

Comments

The survivor w(n,3) in a modified Josephus problem, with a step of 3.

See A090569 or the reference for the definition of w(n,q).

Links

• Chris Groër, The Mathematics of Survival: From Antiquity to the Playground, Amer. Math. Monthly, 110 (No. 9, 2003), 812-825.
• Index entries for sequences related to the Josephus Problem

Crossrefs

Cf. A006257, A088442, A088452, A090569.

Formula

A recurrence is given in the reference.

Extensions

Terms computed by Chris Groer (cgroer(AT)math.uga.edu)

More terms from John W. Layman, Feb 05 2004