Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145846
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145846 Number of permutations of length 2n which are invariant under the reverse-complement map and have no decreasing subsequences of length 6. +0
1
1, 2, 8, 47, 357, 3270, 34515, 406460, 5215829, 71677058, 1041363040, 15841778155, 250494079945, 4093630537014 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = sum(j, 0, n, C(n,j)^2 * A000108(n-j) * A005802(j)),

where C(n,j) = n!/(j!(n-j)!)

MATHEMATICA

Table[Sum[ Binomial[n, j]^2*((1/(n - j + 1))* Binomial[2*(n - j), n - j]/((j + 1)^2*(j + 2)))* Sum[Binomial[2*i, i]*Binomial[j + 1, i + 1]* Binomial[j + 2, i + 1], {i, 0, j}], {j, 0, n}], {n, 0, 20}]

CROSSREFS

Adjacent sequences: A145843 A145844 A145845 this_sequence A145847 A145848 A145849

Sequence in context: A096656 A102009 A135904 this_sequence A009566 A003275 A078558

KEYWORD

nonn

AUTHOR

Eric Egge (eegge(AT)carleton.edu), Oct 21 2008

page 1

Search completed in 0.005 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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research