id:A114894 - OEIS Search Results

Search: id:A114894

Displaying 1-1 of 1 results found.

page 1

a(n) is the minimal k such that a deck of 2k cards is returned to its original state by n out-shuffles.

+0
1

1, 2, 4, 3, 16, 5, 64, 9, 37, 6, 12, 7, 4096, 22, 76, 129, 65536, 10, 262144, 13, 25, 35, 24, 60, 301, 1366, 131329, 15, 117, 39, 32769 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Eric Weisstein's World of Mathematics, Out-Shuffle`
	CROSSREFS	`Sequence in context: A079308 A115399 A109429 this_sequence A053124 A071970 A111172` `Adjacent sequences: A114891 A114892 A114893 this_sequence A114895 A114896 A114897`
	KEYWORD	`nonn,more`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com), Jan 05 2006`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research