|
Search: id:A088443
|
|
|
| A088443 |
|
A linear version of the Josephus problem: a(n) = the function w_3(n). |
|
+0
4
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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).
|
|
REFERENCES
|
Chris Groer, 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: A099510 A137633 A066633 this_sequence A117352 A137710 A068009
Adjacent sequences: A088440 A088441 A088442 this_sequence A088444 A088445 A088446
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 09 2003
|
|
EXTENSIONS
|
Terms computed by Chris Groer (cgroer(AT)math.uga.edu)
More terms from John W. Layman (layman(AT)math.vt.edu), Feb 05 2004
|
|
|
Search completed in 0.002 seconds
|
