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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182459 Numbers n of initial person such that the n-th person survives in the duck-duck-goose game. 0
1, 2, 13, 20, 46, 157, 236, 532, 1198, 4045, 6068, 13654, 46084, 103690, 1181101, 1771652, 3986218, 102162424, 229865455, 344798183, 517197275, 775795913, 1163693870, 3927466813, 5891200220, 13255200496, 29824201117, 44736301676, 100656678772, 226477527238 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

In more detail: n students are sitting in a circle. A professor starts tagging them in the pattern - duck, duck, goose, ... . If a student is tagged goose he or she leaves the circle immediately. The last remaining student is the winner. These are the numbers n of initial students such that the n-th student will be the winner.

LINKS

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

Eric Weisstein's World of Mathematics, Josephus Problem

Wikipedia, Josephus problem

FORMULA

a(n) = A081615(n)-1.

CROSSREFS

Sequence in context: A219278 A099419 A061871 * A303669 A084651 A285087

Adjacent sequences:  A182456 A182457 A182458 * A182460 A182461 A182462

KEYWORD

nonn

AUTHOR

Dan Fodor, Apr 30 2012

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 13:17 EDT 2019. Contains 324325 sequences. (Running on oeis4.)