Sequence A112088 Motivation and Example?

[Simon Strandgaard]

On 7/26/07, Rainer Rosenthal <r.rosenthal at web.de> wrote:
> Max Alekseyev wrote:
> > On 6/9/06, Max <maxale at gmail.com> wrote:
> >>On 6/9/06, Graeme McRae <g_m at mcraefamily.com> wrote:
> >>>It took me quite some time to understand how Ranier Rosenthal is counting
>                                                 Rainer (please)
> >>>rounds, before I obtained A112088 as the number of rounds necessary to kill
> >>>all but one of n players of the Josephus Game with every third man out.
>
> Many many thanks for this post!
>
> Some days ago I found my last scribblings, which were meant for
> another comment to A112088. But it's all that long ago ... I
> didn't understand anything of what I wrote :-(
>
> I'm going to print your mail now and maybe I will find the
> energy to get back to all these lovely round-countings.
>
> As far as I remember I wasn't able to really grasp the idea of
> the original submitter (Simon Strandgaard). From the discussions
> in de.sci.mathematik and de.rec.denksport I remember that there
> were some remarks giving hints to Knuth. Oops ... long time ago.

I wrote a step-by-step guide to how a112088 works, see
http://www.research.att.com/~njas/sequences/a112088.html

maybe it can be useful to you?

-- 
Simon Strandgaard