The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Jan 17 2022 11:08:43
%S 0,1,4,5,6,7,1,2,5,6,7,8,1,2,3,4,7,8,2,3,4,5,8,9
%N A weight function for the case N = 24 and k = 6 in Butler-Graham shuffling.
%C Example from p.12 of Butler. Abstract: We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of their labels and add them to the shuffled stack. We show how to find stacks of cards invariant and periodic under the shuffling. We also show when gcd(q,k)=1 the possible periods of this shuffling are all divisors of order_k(N-q).
%H Steve Butler, R. L. Graham, <a href="http://arxiv.org/abs/1003.4422">Shuffling with ordered cards</a>, March 23, 2010.
%K nonn,fini,full
%O 0,3
%A _Jonathan Vos Post_, Mar 24 2010