login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060135 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. 2
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; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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 * A057112 A071956 A077767

Adjacent sequences:  A060132 A060133 A060134 * A060136 A060137 A060138

KEYWORD

nonn

AUTHOR

Antti Karttunen Mar 02 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 10:39 EST 2012. Contains 205904 sequences.