User blog:QuasarBooster/Laver tables in Python

I present another entry in this obfuscated Python code series. I'm a little surprised that the q function only ended up taking just 180 characters. While building up the initial pieces for this code, I also made visuals for the first few Laver tables. def q(n): def p(n): s=2**n r=range(s) L=(i+1)%s]for i in r]   for i in r:      S=L[s-i-1]      for j in range(s-1):        S+=[L[S[j[S[0]]] t=1 R=L[0] while R[:t]*(len(R)//t)!=R:t*=2 return t m=0 while p(m)<2**n:m+=1 return m