[seqfan] More terms needed for new sequence

[Russell Walsmith]

The elements of the symmetric group S[n] may be represented as n!
permutations of the numbers 1,2,3… n. Different pairings of these
permutations will (by use of the recursive algorithm described at
http://ixitol.com/AAEPG.pdf) generate various infinite periodic sequences.
The greatest period lengths for n = 1,2,3 4 and 5 are 1,2 8,18 and (likely)
96. Can anyone generate more terms (and confirm or correct the n = 5 term
in the process)? Thanks…