Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092254
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092254 Number of permutations of 1,..,2n with alternate odd/even entries that have no adjacent members. +0
1
0, 0, 0, 10, 226, 8600 (list; graph; listen)
OFFSET

1,4

EXAMPLE

The 10 for a(4) are;

[7, 4, 1, 6, 3, 8, 5, 2]

[5, 2, 7, 4, 1, 8, 3, 6]

[5, 2, 7, 4, 1, 6, 3, 8]

[1, 4, 7, 2, 5, 8, 3, 6]

[3, 8, 5, 2, 7, 4, 1, 6]

[3, 6, 1, 4, 7, 2, 5, 8]

[5, 8, 3, 6, 1, 4, 7, 2]

[3, 6, 1, 8, 5, 2, 7, 4]

[1, 6, 3, 8, 5, 2, 7, 4]

[7, 2, 5, 8, 3, 6, 1, 4]

PROGRAM

(PARI) { for (i=1, 6, c=0; for (j=1, i!, for (k=1, i!, x=numtoperm(i, j); y=numtoperm(i, k); v=vector(2*i); forstep (z=1, 2*i, 2, v[z]=x[(z+1)/2]*2-1); forstep (z=2, 2*i, 2, v[z]=y[z/2]*2); fl=1; for (z=1, 2*i-1, if (v[z]==v[z+1]+1, fl=0; break); if (v[z]==v[z+1]-1, fl=0; break)); if (fl==1, c++))); print1(", "c)) }

CROSSREFS

Sequence in context: A166181 A064333 A052789 this_sequence A004702 A027952 A056602

Adjacent sequences: A092251 A092252 A092253 this_sequence A092255 A092256 A092257

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Feb 20 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research