OFFSET
0,3
COMMENTS
a(n) is the number of reduced rearrangement patterns, i.e., the number of reduced rearrangement map equivalence classes formed from the two rotation involutions.
REFERENCES
J. Burns, Counting a Class of Signed Permutations and Chord Diagrams related to DNA Rearrangement, Preprint.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..400
FORMULA
EXAMPLE
For n=0 the a(0)=1 solution is { ∅ }
For n=1 the a(1)=1 solution is { +1 }
For n=2 the a(2)=2 solutions are { +2+1, +1-2 }
For n=3 the a(3)=10 solutions are { +3-2+1, +1+3-2, +2-3+1, +1+3+2, +2+1-3, +3+1-2, +1-3+2, +3+2+1, +3+2-1, +1-2+3 }
MATHEMATICA
Table[(Round[2^n*Exp[-1/2]*(n + 1/2)*(n - 1)!] + Round[2^n*Exp[ -1/4]*(1 - (1 + (-1)^n)/(4 n))*Floor[n/2]!])/4, {n, 1, 20}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jonathan Burns, Apr 13 2016
STATUS
approved