Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133227
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133227 The number of ways of selecting an ordered pair of permutations {P_1,P_2} out of S={1,2..,n} (i)each of length floor function {n/2} (ii)each element of P_1 is less than corresponding element of P_2 (iii) There are no common elements between P_1 and P_2. +0
1
1, 3, 15, 15, 105, 105 (list; graph; listen)
OFFSET

1,2

COMMENT

Select a permutation of length k=floor function{n/2} from a set {1,2...,n). construct a cuboid-1 in k-th dimension. Without replacement find another permutation of same length and construct cuboid-2. Cuboid-1 can be kept within cuboid-2.

FORMULA

a(2n+2)= (1+2n)*a(2n) a(2n+1)= (1+2n)*a(2n) with a(2)=1,a(3)=3

EXAMPLE

a(3)=3 lists {[1][2]},{[1][3]},{[2][3]}

a(4)=15 lists {[12][34]}, {[21][34]}, {[13][24]}, {[12][35]}, {[21][35]}, {[13][25]}, {[14][35]}, {[24][35]}, {[14][25]}, {[12][45]}, {[21][45]}, {[13][45]}, {[31][45]}, {[23][45]}, {[32][45]}

CROSSREFS

Cf. A055634.

Sequence in context: A099476 A063628 A096672 this_sequence A074043 A120467 A012634

Adjacent sequences: A133224 A133225 A133226 this_sequence A133228 A133229 A133230

KEYWORD

nonn

AUTHOR

Srikanth K S (sriperso(AT)gmail.com), Oct 13 2007

EXTENSIONS

Is this A133221 with a slightly different beginning? - njas, Oct 13 2007

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 December 4 15:51 EST 2008. Contains 151308 sequences.


AT&T Labs Research