id:A060135 - OEIS Search Results

Search: id:A060135

Displaying 1-1 of 1 results found.

page 1

Sequence of adjacent transpositions (a[n] a[n]+1), which, when starting from the identity permutation and applied successively, produce a Hamiltonian circuit through all permutations of S_4, in such way that S_{n-1} is always traversed before the rest of S_n. Furthermore, each subsequence from the first to the (n!-1)-th term is palindromic.

+0
3

1, 2, 1, 2, 1, 3, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 3, 1, 2, 1, 2, 1 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`This is lexicographically the ninth of all such Hamiltonian paths through S4.` `I will try to extend this in some elegant fashion through all S_inf so that the same criteria will hold. There are 466 ways to extend this to S5.`
	LINKS	`A. Karttunen, Truncated octahedron` `Index entries for sequences related to bell ringing`
	FORMULA	`[seq(sol9seq(n), n=1..23)];`
	MAPLE	sol9seq := n -> (`if`((n < 13), adj_tp_seq(n), sol9seq(24-n)));
	CROSSREFS	`Cf. A057112.` `Sequence in context: A072527 A081373 A029436 this_sequence A057112 A071956 A077767` `Adjacent sequences: A060132 A060133 A060134 this_sequence A060136 A060137 A060138`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Mar 02 2001`

page 1

Search completed in 0.002 seconds

Last modified December 6 22:51 EST 2009. Contains 170429 sequences.

AT&T Labs Research