OFFSET
0,3
COMMENTS
a(n) is the number of length n permutations that simultaneously avoid the bivincular patterns (123,{2},{}) and (132,{},{2}). - Christian Bean, Jun 03 2015
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..685
Christian Bean, A Claesson, H Ulfarsson, Simultaneous Avoidance of a Vincular and a Covincular Pattern of Length 3, arXiv preprint arXiv:1512.03226, 2015
FORMULA
a(n) = Sum_{k=0..n} C(k*(k+1)/2,n-k).
a(n) = A131338(n+1, n*(n+1)/2 + 1) for n>=0, where triangle A131338 starts with a '1' in row 0 and then for n>0 row n consists of n '1's followed by the partial sums of the prior row. - Paul D. Hanna, Aug 30 2007
From Paul D. Hanna, Apr 24 2010: (Start)
Let q = (1+x), then g.f. A(x) equals the continued fraction:
A(x) = 1/(1 - q*x/(1 - (q^2-q)*x/(1 - q^3*x/(1 - (q^4-q^2)*x/(1 - q^5*x/(1- (q^6-q^3)*x/(1 - q^7*x/(1 - (q^8-q^4)*x/(1 - ...)))))))))
due to an identity of a partial elliptic theta function.
(End)
G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (1 - x*(1+x)^(2*k-2))/(1 - x*(1+x)^(2*k-1)). - Paul D. Hanna, Mar 21 2018
MATHEMATICA
Table[Sum[Binomial[k*(k+1)/2, n-k], {k, 0, n}], {n, 0, 30}] (* Vaclav Kotesovec, Jun 03 2015 *)
PROG
(PARI) a(n) = sum(k=0, n, binomial(k*(k+1)/2, n-k))
for(n=0, 30, print1(a(n), ", "))
(PARI) {a(n)=polcoeff(sum(m=0, n, x^m*prod(k=1, m, (1 - x*(1+x)^(2*k-2))/(1 - x*(1+x)^(2*k-1) + x*O(x^n)))), n)}
for(n=0, 30, print1(a(n), ", ")) \\ Paul D. Hanna, Mar 21 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Aug 15 2006
STATUS
approved