|
|
A131454
|
|
2 up, 2 down, ..., 2 up, 2 down, 2 up permutations of length 4n+3.
|
|
4
|
|
|
1, 71, 45541, 120686411, 908138776681, 15611712012050351, 531909061958526321421, 32491881630252866646683891, 3302814916156503291298772711761, 527393971346575736206847604137659031, 126355819963625435928020023737689391659701
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Bisection of A005981. The entries listed above suggest various congruences for a(n): a(n) = 1 (mod 10), a(n) = 1 + 70*n (mod 100), a(n) = 1 + 70*n + 200*n(n-1) (mod 1000). Are these congruences true for all n? For an arbitrary integer m, the sequence a(n) taken modulo m may eventually become periodic. Compare with A081727.
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: Sum_{n>=0} a(n)*(x^(4n+3))/(4n+3)! = (exp(2x)-2*sin(x)*exp(x)-1)/(2*exp(x)+cos(x)*(exp(2x)+1)). It appears that a(n) = (4n+3)!*coefficient of x^(4n+3) in the Taylor expansion of -4/(2*exp(x)+cos(x)*(exp(2x)+1)).
|
|
EXAMPLE
|
(1 4 5 3 2 6 7) is a 2 up, 2 down, 2 up permutation - one of the seventy-one permutations of this type in the symmetric group on 7 letters.
|
|
MAPLE
|
g:=(sinh(x)-sin(x))/(cos(x)*cosh(x)+1): series(%, x, 44):
|
|
MATHEMATICA
|
Table[(CoefficientList[Series[(-Sin[x] + Sinh[x]) / (1 + Cos[x]*Cosh[x]), {x, 0, 60}], x] * Range[0, 59]!)[[n]], {n, 4, 60, 4}] (* Vaclav Kotesovec, Sep 09 2014 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|