%I A024222
%S A024222 0,1,2,2,4,4,3,3,6,6,10,10,12,12,4,4,8,8,18,18,6,6,11,11,20,20,18,18,
%T A024222 28,28,5,5,10,10,12,12,36,36,12,12,20,20,14,14,12,12,23,23,21,21,8,8,
%U A024222 52,52,20,20,18,18,58,58,60,60,6,6,12,12,66,66,22,22,35,35,9,9,20,20
%N A024222 Shuffles (perfect faro shuffles with cut) required to return a deck of 
               size n to original order.
%D A024222 Tim Folger, "Shuffling Into Hyperspace," Discover, 1991 (vol 12, no 1), 
               pages 66-67.
%D A024222 Martin Gardner, "Card Shuffles," Mathematical Carnival chapter 10, pages 
               123-138. New York: Vintage Books, 1977.
%D A024222 S. Brent Morris, Magic Tricks, Card Shuffling and Dynamic Computer Memories, 
               Math. Assoc. Am., 1998, p. 107.
%e A024222 a(52)=8: a deck of size 52 returns to original order in 8 perfect faro 
               shuffles.
%Y A024222 A002326 is really the fundamental sequence for this problem. Cf. A024542.
%Y A024222 Sequence in context: A128442 A038674 A090277 this_sequence A110545 A104798 
               A143358
%Y A024222 Adjacent sequences: A024219 A024220 A024221 this_sequence A024223 A024224 
               A024225
%K A024222 easy,nonn
%O A024222 1,3
%A A024222 Enoch Haga (Enokh(AT)comcast.net)