Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A060135

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
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 a 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.
(history; published version)
#10 by Wesley Ivan Hurt at Sat Jun 12 23:34:57 EDT 2021
STATUS

proposed

approved

#9 by Jon E. Schoenfield at Sat Jun 12 23:26:39 EDT 2021
STATUS

editing

proposed

#8 by Jon E. Schoenfield at Sat Jun 12 23:26:38 EDT 2021
NAME

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 a 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.

STATUS

approved

editing

#7 by Charles R Greathouse IV at Thu May 01 02:46:43 EDT 2014
AUTHOR

_Antti Karttunen _, Mar 02 2001

Discussion
Thu May 01
02:46
OEIS Server: https://oeis.org/edit/global/2205
#6 by Russ Cox at Sun Jul 10 18:20:31 EDT 2011
LINKS

<a href="/Sindx_index/Be.html#bell_ringing">Index entries for sequences related to bell ringing</a>

Discussion
Sun Jul 10
18:20
OEIS Server: https://oeis.org/edit/global/22
#5 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

<a href="/Sindx_Be.html#bell_ringing">Index entries for sequences related to bell ringing</a>

KEYWORD

nonn,new

nonn

#4 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
NAME

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.

LINKS

<a href="http://www.research.att.com/~njas/sequences/Sindx_Be.html#bell_ringing">Index entries for sequences related to bell ringing</a>

KEYWORD

nonn,new

nonn

#3 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004
LINKS

<a href="http://www.research.att.com/~njas/sequences/Sindx_Be.html#bell_ringing">Index entries for sequences related to bell ringing</a>

KEYWORD

nonn,new

nonn

#2 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003
KEYWORD

nonn,new

nonn

AUTHOR

Antti Karttunen 05 Mar 02 2001

#1 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
NAME

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.

DATA

1, 2, 1, 2, 1, 3, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 3, 1, 2, 1, 2, 1

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, <a href="http://www.iki.fi/~kartturi/matikka/permgraf/troctahe.htm">Truncated octahedron</a>

FORMULA

[seq(sol9seq(n), n=1..23)];

MAPLE

sol9seq := n -> (`if`((n < 13), adj_tp_seq(n), sol9seq(24-n)));

CROSSREFS

Cf. A057112.

KEYWORD

nonn

AUTHOR

Antti Karttunen 05 Mar 2001

STATUS

approved