Order of the Mongean shuffle permutation of 2n cards: a(n) is least number m for which either 2^m + 1 or 2^m - 1 is divisible by 4n + 1.
A019567
Order of the Mongean shuffle permutation of 2n cards: a(n) is least number m for which either 2^m + 1 or 2^m - 1 is divisible by 4n + 1.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =6a(4) =4a(5) =6a(6) =10a(7) =14a(8) =5a(9) =18a(10) =10a(11) =12a(12) =21a(13) =26a(14) =9a(15) =30a(16) =6a(17) =22a(18) =9a(19) =30a(20) =27a(21) =8a(22) =11a(23) =10a(24) =24a(25) =50a(26) =12a(27) =18a(28) =14a(29) =12
External references
- oeis: A019567