n=49: 74 reachable points with |B|<=12, 15 direction classes
distinct patterns: class | (preclosed length / shortest , reduced factor) ... | unreduced factor tuples -> number of direction classes
  class -    | 1.00000:x7  1.99589:x7  2.98358:x7  3.95901:x7  4.91817:x7  5.85712:x7  6.77200:x1  7.65906:x7  8.51464:x7  9.33523:x7  10.11747:x7  10.85813:x7  11.55417:x7  12.20273:x1  12.80115:x7  13.34696:x7  13.83793:x7  14.27204:x7  14.64750:x7  14.96277:x7  15.21655:x1  15.40781:x7  15.53575:x7  15.59986:x7 | {(49, 49, 49, 49, 49, 49, 7, 49, 49, 49, 49, 49, 49, 7, 49, 49, 49, 49, 49, 49, 7, 49, 49, 49): 12, (7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7): 3} | n among reduced factors: False
longest closed trajectory met: 1078 bounces
direction classes with a reduced factor equal to n: 0 of 15
Theorem 7(b) on these direction classes: classes 15 ; with exactly m=24 bands of distinct preclosed length: 15 ; preclosed lengths proportional to sin(2j pi/n): 15 ; factors = n/gcd(n, alpha*j) for some alpha: 15 ; gcd(alpha, n) -> number of classes: {1: 12, 7: 3}
exact decisions: 295262, time 19.1s
