id:A032436 - OEIS Search Results

Search: id:A032436

Displaying 1-1 of 1 results found.

page 1

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.

+0
3

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, 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, 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 (list; table; graph; listen)

	OFFSET	`3,4`
	REFERENCES	`Ball, W. W. R. and Coxeter, H. S. M., Mathematical Recreations and Essays, 13th ed. New York: Dover, pp. 32-36, 1987.` `Kraitchik, M. "Josephus' Problem." Sec. 3.13 in Mathematical Recreations. New York: W.W. Norton, pp. 93-94, 1942.`
	LINKS	`Eric Weisstein's World of Mathematics, More information`
	CROSSREFS	`Cf. A032434, A032435, A032436.` `Sequence in context: A102054 A111604 A101491 this_sequence A073408 A120454 A076511` `Adjacent sequences: A032433 A032434 A032435 this_sequence A032437 A032438 A032439`
	KEYWORD	`nonn,tabl`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:13 EST 2009. Contains 167514 sequences.

AT&T Labs Research