This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 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; text; 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 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: A029436 A263274 A292997 * A057112 A071956 A077767 Adjacent sequences:  A060132 A060133 A060134 * A060136 A060137 A060138 KEYWORD nonn AUTHOR Antti Karttunen, Mar 02 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 20:06 EST 2018. Contains 318087 sequences. (Running on oeis4.)