

A114894


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


0



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, 1073741824, 32769, 81, 21846, 36, 19, 112, 87382, 40, 94, 6684, 74, 216, 58, 316, 71, 1176, 49
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

The sequence continues with a(49)a(80) = L, 126, 52, 27, 3181, 41, 357, 247, 16189, 30, 89976, 31, L, 357913942, 1789, 321, 126961, 34, 96853861, 69, 165, 107, 114240, 162, 220, 335, 2104, 115, 1461, 119, 1344, 1414 where L > 2*10^10. [Lars Blomberg, Sep 22 2014]


LINKS

Table of n, a(n) for n=1..48.
Eric Weisstein's World of Mathematics, OutShuffle


CROSSREFS

Sequence in context: A271363 A115399 A109429 * A183169 A308317 A318363
Adjacent sequences: A114891 A114892 A114893 * A114895 A114896 A114897


KEYWORD

nonn,more


AUTHOR

Eric W. Weisstein, Jan 05 2006


EXTENSIONS

Corrected a(31), added a(32)a(48) by Lars Blomberg, Sep 22 2014


STATUS

approved



