login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032436 Triangle of third-to-last man to survive in the Josephus problem of n men in a circle with every k-th killed, with k<=n. 3

%I

%S 1,1,1,2,1,1,1,3,1,2,1,2,4,1,1,3,1,2,5,3,1,2,1,1,2,6,1,4,3,3,1,1,2,7,

%T 3,1,1,2,4,1,1,2,8,1,4,1,3,3,5,1,1,4,9,3,2,5,1,5,1,1,4,3,2,10,1,5,1,1,

%U 3,8,2,1,1,1,2,11,3,1,5,6,4,2,4,3,1,1,1,7,12,5,2,3,2,1,9,4,5,7,1,1,6

%N Triangle of third-to-last man to survive in the Josephus problem of n men in a circle with every k-th killed, with k<=n.

%D Ball, W. W. R. and Coxeter, H. S. M., Mathematical Recreations and Essays, 13th ed. New York: Dover, pp. 32-36, 1987.

%D Kraitchik, M. "Josephus' Problem." Sec. 3.13 in Mathematical Recreations. New York: W.W. Norton, pp. 93-94, 1942.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/JosephusProblem.html">More information</a>

%Y Cf. A032434, A032435, A032436.

%K nonn,tabl

%O 3,4

%A _N. J. A. Sloane_.

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 January 19 00:40 EST 2020. Contains 331030 sequences. (Running on oeis4.)