login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088443 A linear version of the Josephus problem: a(n) = the function w_3(n). 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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

Table of n, a(n) for n=1..84.

Chris Groƫr, The Mathematics of Survival: From Antiquity to the Playground, Amer. Math. Monthly, 110 (No. 9, 2003), 812-825.

FORMULA

A recurrence is given in the reference.

CROSSREFS

Cf. A006257, A088442, A088452, A090569.

Sequence in context: A066633 A238415 A283826 * A117352 A137710 A068009

Adjacent sequences:  A088440 A088441 A088442 * A088444 A088445 A088446

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Nov 09 2003

EXTENSIONS

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

More terms from John W. Layman, Feb 05 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 09:05 EST 2018. Contains 317348 sequences. (Running on oeis4.)