A riffle shuffle is executed as follows: a deck of cards is split into two equal halves, with the top half taken in the left hand and the bottom half taken in the right hand. Next, the cards are interleaved exactly, with the top card in the right half inserted just after the top card in the left half, the 2nd card in the right half just after the 2nd card in the left half, etc. (Note that this process preserves the location of the top and bottom card of the deck)
Let s(n) be the minimum number of consecutive riffle shuffles needed to restore a deck of size n to its original configuration, where n is a positive even number.
Amazingly, a standard deck of 52 cards will first return to its original configuration after only 8 perfect shuffles, so s(52)=8. It can be verified that a deck of 86 cards will also return to its original configuration after exactly 8 shuffles, and the sum of all values of n that satisfy s(n)=8 is 412.
Find the sum of all values of n that satisfy s(n)=60.
k riffle shuffles will restore the order of an n-card deck if (mod n-1).
from sympy import divisors
def p622(x=60):
res = 0
for d in divisors(2 ** x - 1):
if all((2 ** k - 1) % d != 0 for k in range(2, x)):
res += d + 1
return res3010983666182123972