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

A114894

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

Terms

    a(0) =1a(1) =2a(2) =4a(3) =3a(4) =16a(5) =5a(6) =64a(7) =9a(8) =37a(9) =6a(10) =12a(11) =7a(12) =4096a(13) =22a(14) =76a(15) =129a(16) =65536a(17) =10a(18) =262144a(19) =13a(20) =25a(21) =35a(22) =24a(23) =60a(24) =301a(25) =1366a(26) =131329a(27) =15a(28) =117a(29) =39

External references