Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145845
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145845 Number of permutations of length 2n+1 which are invariant under the reverse-complement map and have no decreasing subsequences of length 5. +0
1
1, 2, 7, 34, 208, 1504, 12283, 109778, 1050820, 10614856, 111978128 (list; graph; listen)
OFFSET

0,2

FORMULA

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

= sum(j=0, n, C(n,j)^2 * (1/((j+1)^2 (j+2))) *

sum(i=0, j, C(2i,i)*C(j+1,i+i)*C(j+2,i+1)))

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

MATHEMATICA

Table[Sum[ Binomial[n, j]^2*(1/((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

Sequence in context: A075834 A011800 A112916 this_sequence A002720 A111539 A074059

Adjacent sequences: A145842 A145843 A145844 this_sequence A145846 A145847 A145848

KEYWORD

nonn

AUTHOR

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

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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research