login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193776 Number of signed permutations of length n invariant under the reverse complement and avoiding (-2, -1), (-2, 1), (2, -1). 0
1, 2, 3, 5, 12, 17, 65, 80, 473, 527 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..9.

FORMULA

a(2k) = 2^k k! + \sum_{j=0}^{k-1}(k-j-1)! a(2j)

a(2k+1) = (2^k + 1)k! + \sum_{j=0}^{k-1}(k-j-1)! a(2j+1)

EXAMPLE

For n = 2, the permutations are (1, 2), (2, 1), (-1, -2), (-2, -1).

CROSSREFS

Sequence in context: A271227 A002139 A140489 * A051915 A064688 A089891

Adjacent sequences:  A193773 A193774 A193775 * A193777 A193778 A193779

KEYWORD

nonn

AUTHOR

Andy Hardt, Aug 04 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 20:40 EST 2016. Contains 278745 sequences.