User:R. J. Cano/Permutation Sequences

A207324: List of permutations of 1,2,3,...,n for n=1,2,3,..., in the order they are output by Steinhaus-Johnson-Trotter algorithm.

[Sequencer program (PARI-GP)][1]]

Related downloads

[[PARI-GP Experimental implementation of the SJT algorithm (Kept here only for curiosity and experimental purposes, testing counters for the final version or link #1).][2]]

[[PARI-GP Experimental implementation of the SJT algorithm (Kept here only for curiosity and experimental purposes, apparently a minimal sieve-completion algorithm).][3]]

See also:

For the generation of permutations in Lexicographic order using the algorithm by Narayana Pandita,

A030298: "List of permutations of 1,2,3,...,n for n=1,2,3,..., in lexicographic order."

Parallelizable by taking advantage of A237265: "Irregular table: n X n matrices (n=1,2,3,...), read by rows filled with numbers 1..n, with k moved to the front in the k-th row."

For the generation of permutations using the algorithm by Shmuel Zaks,

A055881: "a(n) = largest m such that m! divides n."