A117158 -id:A117158 - cp's OEIS frontend

A177553 Number of permutations of 1..n avoiding adjacent step pattern up, up, up, up, up, up.

1, 1, 2, 6, 24, 120, 720, 5039, 40305, 362682, 3626190, 39881160, 478490760, 6219298800, 87055051511, 1305598835941, 20885951018102, 354999461960226, 6388879812001704, 121367620532150280, 2426930566055020080, 50956684690331669759, 1120852238721212726609

Offset: 0

R. H. Hardin, May 10 2010

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..450
Mingjia Yang, Doron Zeilberger, Increasing Consecutive Patterns in Words, arXiv:1805.06077 [math.CO], 2018.
Mingjia Yang, An experimental walk in patterns, partitions, and words, Ph. D. Dissertation, Rutgers University (2020).

Column k=63 of A242784.

Cf. A080635, A049774, A117158, A177533, A177523.

b:= proc(u, o, t) option remember; `if`(u+o=0, 1,
      `if`(t<5, add(b(u+j-1, o-j, t+1), j=1..o), 0)+
      add(b(u-j, o+j-1, 0), j=1..u))
    end:
a:= n-> b(n, 0, 0):
seq(a(n), n=0..30);  # Alois P. Heinz, Oct 07 2013

nn=20;r=6;a=Apply[Plus,Table[Normal[Series[y x^(r+1)/(1-Sum[y x^i,{i,1,r}]),{x,0,nn}]][[n]]/(n+r)!,{n,1,nn-r}]]/.y->-1;Range[0,nn]! CoefficientList[Series[1/(1-x-a),{x,0,nn}],x] (* Geoffrey Critzer, Feb 25 2014 *)
Table[n!*SeriesCoefficient[1/(Sum[x^(7*k)/(7*k)!-x^(7*k+1)/(7*k+1)!,{k,0,n}]),{x,0,n}],{n,1,20}] (* Vaclav Kotesovec, Aug 29 2014 *)

a(n)/n! ~ c * (1/r)^n, where r = 1.0001738181531504504518260962714687775785823593018886... is the root of the equation Sum_{n>=0} (r^(7*n)/(7*n)! - r^(7*n+1)/(7*n+1)!) = 0, c = 1.0010191104259450282450770594076722424772755532278.... - Vaclav Kotesovec, Aug 29 2014
E.g.f.: -(7/(2*((-cos(x*cos(3*Pi/14)))*cosh(x*sin(3*Pi/14)) + cos(x*cos(3*Pi/14))*cosh(x*sin(3*Pi/14))* sin(3*Pi/14) - cosh(x*sin(Pi/14))* (cos(x*cos(Pi/14))*(1 + sin(Pi/14)) - cos(Pi/14)*sin(x*cos(Pi/14))) + cos(3*Pi/14)*cosh(x*sin(3*Pi/14))* sin(x*cos(3*Pi/14)) - cosh(x*cos(Pi/7))* ((1 + cos(Pi/7))*cos(x*sin(Pi/7)) - sin(Pi/7)*sin(x*sin(Pi/7))) + cos(x*sin(Pi/7))* sinh(x*cos(Pi/7)) + cos(Pi/7)*cos(x*sin(Pi/7))* sinh(x*cos(Pi/7)) - sin(Pi/7)*sin(x*sin(Pi/7))* sinh(x*cos(Pi/7)) + cos(x*cos(Pi/14))* sinh(x*sin(Pi/14)) + cos(x*cos(Pi/14))*sin(Pi/14)* sinh(x*sin(Pi/14)) - cos(Pi/14)*sin(x*cos(Pi/14))* sinh(x*sin(Pi/14)) - cos(x*cos(3*Pi/14))* sinh(x*sin(3*Pi/14)) + cos(x*cos(3*Pi/14))* sin(3*Pi/14)*sinh(x*sin(3*Pi/14)) + cos(3*Pi/14)*sin(x*cos(3*Pi/14))* sinh(x*sin(3*Pi/14))))). - Vaclav Kotesovec, Jan 31 2015
In closed form, c = 7 / (r * (2*cos(r*sin(Pi/7))*cosh(r*cos(Pi/7)) + cos(Pi/7 - r*sin(Pi/7)) * cosh(r*cos(Pi/7)) + cos(Pi/7 - r*sin(Pi/7)) * cosh(r*cos(Pi/7)) + 2*cos(r*cos(Pi/14)) * cosh(r*sin(Pi/14)) + 2*cos(r*cos(3*Pi/14)) * cosh(r*sin(3*Pi/14)) + 2*cosh(r*sin(Pi/14)) * sin(Pi/14 + r*cos(Pi/14)) - 2*cosh(r*sin(3*Pi/14)) * sin(3*Pi/14 - r*cos(3*Pi/14)) - 2*cos(r*sin(Pi/7)) * sinh(r*cos(Pi/7)) - cos(Pi/7 - r*sin(Pi/7)) * sinh(r*cos(Pi/7)) - cos(Pi/7 - r*sin(Pi/7)) * sinh(r*cos(Pi/7)) - 2*cos(r*cos(Pi/14)) * sinh(r*sin(Pi/14)) - 2*sin(Pi/14 + r*cos(Pi/14))*sinh(r*sin(Pi/14)) + 2*cos(r*cos(3*Pi/14)) * sinh(r*sin(3*Pi/14)) - 2*sin((3*Pi)/14 - r*cos(3*Pi/14)) * sinh(r*sin(3*Pi/14)))). - Vaclav Kotesovec, Feb 01 2015

a(18)-a(22) from Alois P. Heinz, Oct 07 2013

a(0)=1 prepended by Alois P. Heinz, Aug 08 2018

A201692 Number of permutations that avoid the consecutive pattern 1423.

Original entry on oeis.org

1, 1, 2, 6, 23, 110, 631, 4218, 32221, 276896, 2643883, 27768955, 318174363, 3949415431, 52794067318, 756137263377, 11551672922816, 187507250145806, 3222662529113641, 58464560588277289, 1116469710152742025, 22386721651323946628, 470259350616967829363

Offset: 0

N. J. A. Sloane, Dec 03 2011

Alois P. Heinz, Table of n, a(n) for n = 0..250 (terms n = 0..60 from Ray Chandler)
A. Baxter, B. Nakamura, and D. Zeilberger. Automatic generation of theorems and proofs on enumerating consecutive Wilf-classes
V. Dotsenko and A. Khoroshkin, Shuffle algebras, homology, and consecutive pattern avoidance, arXiv preprint arXiv:1109.2690, 2011

Cf. A113228, A113229, A117156, A117158, A117226, A201693.

c := proc(n,l)
    if n = 1 then
        if l = 0 then
            1;
        else
            0;
        end if;
    elif n= 2 or n = 3 then
        0;
    else
        a := 0 ;
        for k from 1 to (n-2)/2 do
            a := a+procname(n-2*k-1,l-k)*binomial(n-k-2,k) ;
        end do:
        a ;
    end if;
end proc:
A201693 := proc(nmax)
    g := 1-t ;
    for n from 2 to nmax do
        for l from 0 to n/2 do
            g := g-c(n,l)*t^n*(-1)^l/n! ;
        end do:
    end do:
    taylor(1/g,t=0,nmax) ;
end proc:
nmax := 25 ;
egf := A201693(nmax) ;
for n from 0 to nmax-1 do
    printf("%d,",coeftayl(egf,t=0,n)*n!) ;
end do: # R. J. Mathar, Dec 04 2011
# second Maple program:
b:= proc(u, o, t) option remember; `if`(u+o=0, 1,
      add(b(u-j, o+j-1, `if`(0 b(n, 0$2):
seq(a(n), n=0..25);  # Alois P. Heinz, Nov 07 2013

b[u_, o_, t_] := b[u, o, t] = If[u+o == 0, 1, Sum[b[u-j, o+j-1, If[0Jean-François Alcover, Mar 18 2014, after Alois P. Heinz *)

The reference gives an e.g.f. There is an associated triangle of numbers c_{n,l} that should be added to the OEIS if it is not already present.

a(n) ~ c * d^n * n!, where d = 0.95482605094987833345080179991528996596888600981..., c = 1.1567436851576902067739566662625378535625602... . - Vaclav Kotesovec, Sep 11 2014

Definition corrected by N. J. A. Sloane, Mar 15 2015

A201693 Number of permutations that avoid the consecutive pattern 2413.

Original entry on oeis.org

1, 1, 2, 6, 23, 110, 632, 4237, 32465, 279828, 2679950, 28232972, 324470844, 4039771856, 54165468774, 778128659247, 11923645252411, 194131328012012, 3346615262190736, 60897160676005110, 1166446154857250412, 23459656378909613446, 494290181112325561351

Offset: 0

N. J. A. Sloane, Dec 03 2011

Alois P. Heinz, Table of n, a(n) for n = 0..140 (first 61 terms from Ray Chandler)
A. Baxter, B. Nakamura, and D. Zeilberger. Automatic generation of theorems and proofs on enumerating consecutive Wilf-classes
V. Dotsenko and A. Khoroshkin, Shuffle algebras, homology, and consecutive pattern avoidance, arXiv preprint arXiv:1109.2690, 2011

Cf. A113228, A113229, A117156, A117158, A117226, A201692.

The reference gives a g.f. There is an associated triangle of numbers c_{n,l} that should be added to the OEIS if it is not already present.

More terms from Ray Chandler, Dec 06 2011

A230231 Number of permutations of [n] avoiding adjacent step pattern {up}^8.

Original entry on oeis.org

1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362879, 3628781, 39916492, 478996716, 6226941864, 87176969880, 1307651304960, 20922368987520, 355679390626560, 6402213152423659, 121641748198554547, 2432828930036156696, 51089280818439941448, 1123961390341566969192

Offset: 0

Alois P. Heinz, Oct 12 2013

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..450
Mingjia Yang, Doron Zeilberger, Increasing Consecutive Patterns in Words, arXiv:1805.06077 [math.CO], 2018.

Cf. A049774, A117158, A177523, A177533, A177553, A230051, A230232, A230233.

Column k=255 of A242784.

b:= proc(u, o, t) option remember; `if`(u+o=0, 1,
      `if`(t<7, add(b(u+j-1, o-j, t+1), j=1..o), 0)+
      add(b(u-j, o+j-1, 0), j=1..u))
    end:
a:= n-> b(n, 0, 0):
seq(a(n), n=0..30);

nn=20;r=8;a=Apply[Plus,Table[Normal[Series[y x^(r+1)/(1-Sum[y x^i,{i,1,r}]),{x,0,nn}]][[n]]/(n+r)!,{n,1,nn-r}]]/.y->-1;Range[0,nn]! CoefficientList[Series[1/(1-x-a),{x,0,nn}],x] (* Geoffrey Critzer, Feb 25 2014 *)
CoefficientList[Series[1/(HypergeometricPFQ[{}, {1/9, 2/9, 1/3, 4/9, 5/9, 2/3, 7/9, 8/9}, x^9/387420489] - x*HypergeometricPFQ[{}, {2/9, 1/3, 4/9, 5/9, 2/3, 7/9, 8/9, 10/9}, x^9/387420489]), {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Feb 01 2015 *)

E.g.f.: 1 / Sum_{n>=0} (9*n+1-x)*x^(9*n)/(9*n+1)!.
a(n)/n! ~ 1.0000195665100891649606434859189953881417919885320660432331680939719... * (1/r)^n, where r = 1.0000024802134092668222044475851121972165291678378389183730077680957571... is the root of the equation Sum_{n>=0} (r^(9*n)/(9*n)! - r^(9*n+1)/(9*n+1)!) = 0. - Vaclav Kotesovec, Jan 17 2015
E.g.f.: 1/(1/3 * cos((sqrt(3)*x)/2) * cosh(x/2) + 2/9 * cos(x * sin(Pi/9)) * cosh(x * cos(Pi/9)) + 2/9 * cos(Pi/9) * cos(x * sin(Pi/9)) * cosh(x * cos(Pi/9)) + 2/9 * cos(x * cos(Pi/18)) * cosh(x * sin(Pi/18)) + 2/9 * cos(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9)))* cosh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9))) - 1/9 * cos(Pi/9) * cos(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9))) * cosh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9))) - 2/9 * cos(x * cos(Pi/18))* cosh(x * sin(Pi/18)) * sin(Pi/18) - (cos(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9)))* cosh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9)))* sin(Pi/9))/(3 * sqrt(3)) - (cosh(x/2) * sin((sqrt(3)*x)/2))/(3 * sqrt(3)) - 2/9 * cos(Pi/18) * cosh(x * sin(Pi/18)) * sin(x * cos(Pi/18)) - (cos(Pi/9) * cosh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9)))* sin(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9))))/ (3 * sqrt(3)) + 1/9 * cosh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9)))* sin(Pi/9) * sin(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9))) - 2/9 * cosh(x * cos(Pi/9)) * sin(Pi/9)* sin(x * sin(Pi/9)) - 1/3 * cos((sqrt(3)*x)/2)* sinh(x/2) + (sin((sqrt(3)*x)/2) * sinh(x/2))/ (3 * sqrt(3)) - 2/9 * cos(x * sin(Pi/9))* sinh(x * cos(Pi/9)) - 2/9 * cos(Pi/9) * cos(x * sin(Pi/9))* sinh(x * cos(Pi/9)) + 2/9 * sin(Pi/9) * sin(x * sin(Pi/9))* sinh(x * cos(Pi/9)) + 2/9 * cos(x * cos(Pi/18))* sinh(x * sin(Pi/18)) - 2/9 * cos(x * cos(Pi/18))* sin(Pi/18) * sinh(x * sin(Pi/18)) - 2/9 * cos(Pi/18)* sin(x * cos(Pi/18)) * sinh(x * sin(Pi/18)) + 2/9 * cos(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9)))* sinh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9))) - 1/9 * cos(Pi/9) * cos(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9))) * sinh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9))) - (cos(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9))) * sin(Pi/9)* sinh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9))))/ (3 * sqrt(3)) - (cos(Pi/9) * sin(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9)))* sinh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9))))/ (3 * sqrt(3)) + 1/9 * sin(Pi/9)* sin(x/2*(sqrt(3) * cos(Pi/9) - sin(Pi/9)))* sinh(x/2*(cos(Pi/9) + sqrt(3) * sin(Pi/9)))). - Vaclav Kotesovec, Feb 01 2015

A230232 Number of permutations of [n] avoiding adjacent step pattern {up}^9.

Original entry on oeis.org

1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628799, 39916779, 479001228, 6227014404, 87178179816, 1307672369640, 20922752672640, 355686706327680, 6402359109968640, 121644792614741760, 2432895242801771955, 51090787299486057355, 1123997039003038423610

Offset: 0

Alois P. Heinz, Oct 12 2013

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..450

Cf. A049774, A117158, A177523, A177533, A177553, A230051, A230231, A230233.

Column k=511 of A242784.

b:= proc(u, o, t) option remember; `if`(u+o=0, 1,
      `if`(t<8, add(b(u+j-1, o-j, t+1), j=1..o), 0)+
      add(b(u-j, o+j-1, 0), j=1..u))
    end:
a:= n-> b(n, 0, 0):
seq(a(n), n=0..30);

nn=20;r=9;a=Apply[Plus,Table[Normal[Series[y x^(r+1)/(1-Sum[y x^i,{i,1,r}]),{x,0,nn}]][[n]]/(n+r)!,{n,1,nn-r}]]/.y->-1;Range[0,nn]! CoefficientList[Series[1/(1-x-a),{x,0,nn}],x] (* Geoffrey Critzer, Feb 25 2014 *)
FullSimplify[CoefficientList[Series[10/(2/E^x - Sqrt[2*(5 - Sqrt[5])]* Cosh[(1/4)*(1 + Sqrt[5])*x]* Sin[Sqrt[(1/8)*(5 - Sqrt[5])]*x] - Sqrt[2*(5 + Sqrt[5])]*Cosh[(1/4)*(Sqrt[5] - 1)* x]*Sin[Sqrt[(1/8)*(5 + Sqrt[5])]*x] + Cos[Sqrt[(1/8)*(5 + Sqrt[5])]*x]* (4*Cosh[(1/4)*(Sqrt[5] - 1)*x] - (Sqrt[5] - 1)*Sinh[(1/4)*(Sqrt[5] - 1)*x]) - Cos[Sqrt[(1/8)*(5 - Sqrt[5])]*x]* ((1 + Sqrt[5])*Sinh[(1/4)*(1 + Sqrt[5])*x] - 4*Cosh[(1/4)*(1 + Sqrt[5])*x])), {x, 0, 20}], x] * Range[0, 20]!] (* Vaclav Kotesovec, Jan 31 2015 *)

E.g.f.: 1 / Sum_{n>=0} (10*n+1-x)*x^(10*n)/(10*n+1)!.
a(n)/n! ~ c * (1/r)^n, where r = 1.0000002505217051890946793081039639693008257169189079028339632923816... is the root of the equation Sum_{n>=0} (r^(10*n)/(10*n)! - r^(10*n+1)/(10*n+1)!) = 0, c = 1.000002229648140602899529055054469878816530201510267349345270187155... . - Vaclav Kotesovec, Jan 17 2015
E.g.f.: 10 / (2/exp(x) - sqrt(2*(5 - sqrt(5))) * cosh((1/4)*(1 + sqrt(5))*x) * sin(sqrt((1/8)*(5 - sqrt(5)))*x) - sqrt(2*(5 + sqrt(5))) * cosh((1/4)*(sqrt(5) - 1)*x) * sin(sqrt((1/8)*(5 + sqrt(5)))*x) + cos(sqrt((1/8)*(5 + sqrt(5)))*x) * (4*cosh((1/4)*(sqrt(5) - 1)*x) - (sqrt(5) - 1)*sinh((1/4)*(sqrt(5) - 1)*x)) - cos(sqrt((1/8)*(5 - sqrt(5)))*x) * ((1 + sqrt(5))*sinh((1/4)*(1 + sqrt(5))*x) - 4*cosh((1/4)*(1 + sqrt(5))*x))). - Vaclav Kotesovec, Jan 31 2015
In closed form, c = 5 / (r * (sqrt(10 - 2*sqrt(5)) * cosh((sqrt(5)+1)*r/4) * sin(sqrt((5 - sqrt(5))/2)*r/2) + sqrt(2*(5 + sqrt(5))) * cosh((sqrt(5)-1)*r/4) * sin(sqrt((5 + sqrt(5))/2)*r/2))). - Vaclav Kotesovec, Feb 01 2015

A230233 Number of permutations of [n] avoiding adjacent step pattern {up}^10.

Original entry on oeis.org

1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916799, 479001577, 6227020358, 87178283010, 1307674215120, 20922786961440, 355687370176320, 6402372516146880, 121645075013280000, 2432901444395385600, 51090929159028595200, 1124000415686590747031

Offset: 0

Alois P. Heinz, Oct 12 2013

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..450

Cf. A049774, A117158, A177523, A177533, A177553, A230051, A230231, A230232.

Column k=1023 of A242784.

b:= proc(u, o, t) option remember; `if`(u+o=0, 1,
      `if`(t<9, add(b(u+j-1, o-j, t+1), j=1..o), 0)+
      add(b(u-j, o+j-1, 0), j=1..u))
    end:
a:= n-> b(n, 0, 0):
seq(a(n), n=0..30);

nn=20;r=10;a=Apply[Plus,Table[Normal[Series[y x^(r+1)/(1-Sum[y x^i,{i,1,r}]),{x,0,nn}]][[n]]/(n+r)!,{n,1,nn-r}]]/.y->-1;Range[0,nn]! CoefficientList[Series[1/(1-x-a),{x,0,nn}],x] (* Geoffrey Critzer, Feb 25 2014 *)
CoefficientList[Series[1/(HypergeometricPFQ[{}, {1/11, 2/11, 3/11, 4/11, 5/11, 6/11, 7/11, 8/11, 9/11, 10/11}, x^11/285311670611] - x*HypergeometricPFQ[{}, {2/11, 3/11, 4/11, 5/11, 6/11, 7/11, 8/11, 9/11, 10/11, 12/11}, x^11/285311670611]), {x, 0, 25}], x] * Range[0, 25]! (* Vaclav Kotesovec, Jan 17 2015 *)

E.g.f.: 1 / Sum_{n>=0} (11*n+1-x)*x^(11*n)/(11*n+1)!.
a(n)/n! ~ 1.000000227556759905306252970186381144189779110025896440589711080508... * (1/r)^n, where r = 1.000000022964438439732421879840792836238519233492197325926442472620564... is the root of the equation Sum_{n>=0} (r^(11*n)/(11*n)! - r^(11*n+1)/(11*n+1)!) = 0. - Vaclav Kotesovec, Jan 17 2015
E.g.f.: -11/(2*((-cos(x*cos(Pi/22)))* cosh(x*sin(Pi/22)) - cos(x*cos(3*Pi/22))* cosh(x*sin(3*Pi/22)) - cos(x*cos(5*Pi/22))* cosh(x*sin(5*Pi/22)) - cos(x*cos(Pi/22))* cosh(x*sin(Pi/22))*sin(Pi/22) + cos(x*cos(3*Pi/22))* cosh(x*sin(3*Pi/22))* sin(3*Pi/22) - cos(x*cos(5*Pi/22))* cosh(x*sin(5*Pi/22))* sin(5*Pi/22) + cos(Pi/22)* cosh(x*sin(Pi/22))* sin(x*cos(Pi/22)) + cos(3*Pi/22)*cosh( x*sin(3*Pi/22))* sin(x*cos(3*Pi/22)) + cos(5*Pi/22)*cosh( x*sin(5*Pi/22))* sin(x*cos(5*Pi/22)) - cosh(x*cos(Pi/11))* ((1 + cos(Pi/11))* cos(x*sin(Pi/11)) - sin(Pi/11)*sin(x*sin(Pi/11))) + cosh(x*cos(2*Pi/11))* ((-1 + cos(2*Pi/11))* cos(x*sin(2*Pi/11)) + sin(2*Pi/11)* sin(x*sin(2*Pi/11))) + cos(x*sin(Pi/11))* sinh(x*cos(Pi/11)) + cos(Pi/11)*cos(x*sin(Pi/11))* sinh(x*cos(Pi/11)) - sin(Pi/11)*sin(x*sin(Pi/11))* sinh(x*cos(Pi/11)) - cos(x*sin(2*Pi/11))* sinh(x*cos(2*Pi/11)) + cos(2*Pi/11)* cos(x*sin(2*Pi/11))* sinh(x*cos(2*Pi/11)) + sin(2*Pi/11)* sin(x*sin(2*Pi/11))* sinh(x*cos(2*Pi/11)) + cos(x*cos(Pi/22))* sinh(x*sin(Pi/22)) + cos(x*cos(Pi/22))*sin(Pi/22)* sinh(x*sin(Pi/22)) - cos(Pi/22)*sin(x*cos(Pi/22))* sinh(x*sin(Pi/22)) - cos(x*cos(3*Pi/22))* sinh(x*sin(3*Pi/22)) + cos(x*cos(3*Pi/22))* sin(3*Pi/22)* sinh(x*sin(3*Pi/22)) + cos(3*Pi/22)* sin(x*cos(3*Pi/22))* sinh(x*sin(3*Pi/22)) + cos(x*cos(5*Pi/22))* sinh(x*sin(5*Pi/22)) + cos(x*cos(5*Pi/22))* sin(5*Pi/22)* sinh(x*sin(5*Pi/22)) - cos(5*Pi/22)* sin(x*cos(5*Pi/22))* sinh(x*sin(5*Pi/22)))). - Vaclav Kotesovec, Jan 31 2015

A217057 Number of permutations in S_n containing exactly one increasing subsequence of length 4.

Original entry on oeis.org

0, 0, 0, 0, 1, 12, 102, 770, 5545, 39220, 276144, 1948212, 13817680, 98679990, 710108396, 5150076076, 37641647410, 277202062666, 2056218941678, 15358296210724, 115469557503753, 873561194459596, 6647760790457218, 50871527629923754, 391345137795371013

Offset: 0

Alois P. Heinz, Sep 25 2012

nonn

			a(4) = 1: 1234.
a(5) = 12: 12453, 12534, 13425, 13452, 14235, 15234, 23145, 23415, 23451, 31245, 41235, 51234.

Brian Nakamura and Doron Zeilberger, Table of n, a(n) for n = 0..70
Andrew R. Conway and Anthony J. Guttmann, Counting occurrences of patterns in permutations, arXiv:2306.12682 [math.CO], 2023. See p. 16.
Brian Nakamura and Doron Zeilberger, Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes; Local copy, pdf file only, no active links
Brian Nakamura and Doron Zeilberger, Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes, arXiv preprint arXiv:1209.2353, 2012.
Wikipedia, Enumerations of specific permutation classes
Wikipedia, Subsequence

Cf. A005802, A117158, A158005, A214015, A214152.

# programs can be obtained from the Nakamura & Zeilberger link.

A071077 Number of permutations that avoid the generalized pattern 1234-5.

Original entry on oeis.org

1, 1, 2, 6, 24, 119, 705, 4857, 38142, 336291, 3289057, 35337067, 413698248, 5241768017, 71465060725, 1043175024243, 16231998346794, 268207096127991, 4690005160446721, 86528908665043683, 1679764981327051508, 34226671269330933413, 730361830628447403029

Offset: 0

Sergey Kitaev, May 26 2002

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..450
Sergey Kitaev, Partially Ordered Generalized Patterns, preprint.
Sergey Kitaev, Partially Ordered Generalized Patterns, Discrete Math. 298 (2005), no. 1-3, 212-229.

Cf. A071088, A071075, A071076, A117158.

b:= proc(u, o, t) option remember; `if`(u+o=0, 1, add(
      `if`(t=2 and o>j, 0, b(u+j-1, o-j, t+1)), j=1..o)+
       add(b(u-j, o+j-1, 0), j=1..u))
    end:
a:= n-> b(n, 0$2):
seq(a(n), n=0..25);  # Alois P. Heinz, Nov 14 2015

b[u_, o_, t_] := b[u, o, t] = If[u+o == 0, 1, Sum[If[t == 2 && o>j, 0, b[u+j-1, o-j, t+1]], {j, 1, o}] + Sum[b[u-j, o+j-1, 0], {j, 1, u}]];
a[n_] := b[n, 0, 0];
a /@ Range[0, 25] (* Jean-François Alcover, Apr 23 2020, after Alois P. Heinz *)

E.g.f.: exp(int(A(y), y=0..x)), where A(y) = 1/(Sum_{i>=0} y^{4*i}/(4*i)! - Sum_{i>=0} y^{4*i+1}/(4*i+1)!).

Let b(n) = A117158(n) = number of permutations of [n] that avoid the consecutive pattern 1234. Then a(n) = Sum_{i = 0..n-1} binomial(n-1,i)*b(i)*a(n-1-i) with a(0) = b(0) = 1. [See the recurrence for A_n and B_n in the proof of Theorem 13 in Kitaev's papers.] - Petros Hadjicostas, Oct 31 2019

Corrected and extended by Vladeta Jovovic, May 28 2002

A220183 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k triple descents (n>=0,0<=k<=n-3). We say that i is a triple descent of a permutation p if p(i) > p(i+1) > p(i+2) > p(i+3).

Original entry on oeis.org

1, 1, 2, 6, 23, 1, 111, 8, 1, 642, 67, 10, 1, 4326, 602, 99, 12, 1, 33333, 5742, 1093, 137, 14, 1, 288901, 59504, 12425, 1852, 181, 16, 1, 2782082, 666834, 151635, 24970, 3029, 231, 18, 1, 29471046, 8054684, 1981499, 355906, 48455, 4902, 287, 20, 1

Offset: 0

Geoffrey Critzer, Dec 12 2012

Row sums = n!.

T(n,0) = A117158.

			:     1;
:     1;
:     2;
:     6;
:    23,    1;
:   111,    8,    1;
:   642,   67,   10,   1;
:  4326,  602,   99,  12,  1;
: 33333, 5742, 1093, 137, 14, 1;
T(5,1) = 8 because we have: (4,5,3,2,1), (3,5,4,2,1), (2,5,4,3,1), (5,4,3,1,2), (1,5,4,3,2), (5,4,2,1,3), (5,3,2,1,4), (4,3,2,1,5).

Alois P. Heinz, Rows n = 0..143, flattened
P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 210

Cf. A162975, A242783, A242784.

b:= proc(u, o, t) option remember; `if`(u+o=0, 1, expand(
      add(b(u-j, o+j-1, 1), j=1..u)+
      add(b(u+j-1, o-j, [2, 3, 3][t])*`if`(t=3, x, 1), j=1..o)))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b(n, 0, 1)):
seq(T(n), n=0..14);  # Alois P. Heinz, Oct 29 2013

nn=10; u=y-1; a=Apply[Plus, Table[Normal[Series[y x^4/(1-y x - y x^2-y x^3), {x,0,nn}]][[n]]/(n+3)!, {n,1,nn-3}]]/.y->u; Range[0,nn]! CoefficientList[Series[1/(1-x-a), {x,0,nn}], {x,y}]//Grid

E.g.f.: 1/(1 - x - Sum_{k,n} I(n,k)(y - 1)^k*x^n/n!) where I(n,k) is the coefficient of y^k*x^n in the ordinary generating function expansion of y x^4/(1 - y*x - y*x^2 - y*x^3) See Flajolet and Sedgewick reference in Links section.

A254523 Number of permutations of [n] avoiding adjacent step pattern {up}^11.

Original entry on oeis.org

1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001599, 6227020775, 87178290682, 1307674357710, 20922789683040, 355687423926240, 6402373618334400, 121645098513933120, 2432901965590252800, 51090941178938707200, 1124000703770606323200

Offset: 0

Vaclav Kotesovec, Jan 31 2015

nonn

Vaclav Kotesovec, Table of n, a(n) for n = 0..200

Cf. A049774, A117158, A177523, A177533, A177553, A230051, A230231, A230232, A230233.

Column k=2047 of A242784.

b:= proc(u, o, t) option remember; `if`(u+o=0, 1,
      `if`(t<10, add(b(u+j-1, o-j, t+1), j=1..o), 0)+
      add(b(u-j, o+j-1, 0), j=1..u))
    end:
a:= n-> b(n, 0, 0):
seq(a(n), n=0..30); # after Alois P. Heinz

CoefficientList[Series[6 / (Exp[-x] + Cos[x] + 2*Cos[x/2] * Cosh[Sqrt[3]*x/2] - Cosh[Sqrt[3]*x/2]*Sin[x/2] - Sin[x] + Cosh[x/2] * (2*Cos[Sqrt[3]*x/2] - Sqrt[3]*Sin[Sqrt[3]*x/2]) - Cos[Sqrt[3]*x/2]*Sinh[x/2] - Sqrt[3]*Cos[x/2]*Sinh[Sqrt[3]*x/2]), {x, 0, 25}], x] * Range[0, 25]!

E.g.f.: 1 / Sum_{n>=0} (12*n+1-x)*x^(12*n)/(12*n+1)!.
E.g.f.: 6 / (exp(-x) + cos(x) + 2*cos(x/2)*cosh(sqrt(3)*x/2) - cosh(sqrt(3)*x/2)*sin(x/2) - sin(x) + cosh(x/2)*(2*cos(sqrt(3)*x/2) - sqrt(3)*sin(sqrt(3)*x/2)) - cos(sqrt(3)*x/2)*sinh(x/2) - sqrt(3)*cos(x/2)*sinh(sqrt(3)*x/2)).
a(n)/n! ~ c * (1/r)^n, where r = 1.0000000019270853046730165249753673978954992128247736041276... is the root of the equation Sum_{n>=0} (r^(12*n)/(12*n)! - r^(12*n+1)/(12*n+1)!) = 0, equivalently root of the equation exp(-r) + cos(r) + 2*cos(r/2)*cosh(sqrt(3)*r/2) - cosh(sqrt(3)*r/2)*sin(r/2) - sin(r) + cosh(r/2)*(2*cos(sqrt(3)*r/2) - sqrt(3)*sin(sqrt(3)*r/2)) - cos(sqrt(3)*r/2)*sinh(r/2) - sqrt(3)*cos(r/2)*sinh(sqrt(3)*r/2) = 0, c = 3/(r*sqrt((cosh(sqrt(3)*r/2) * sin(r/2) + sin(r))^2 + 2*sqrt(3)*cosh(r/2) * (cosh(sqrt(3)*r/2) * sin(r/2) + sin(r)) * sin(sqrt(3)*r/2) + 3*cosh(r/2)^2 * sin((sqrt(3)*r)/2)^2)) = 1.0000000210373483515818712802156496756788404534079689145773611990529818919... .

cp's OEIS Frontend

A177553 Number of permutations of 1..n avoiding adjacent step pattern up, up, up, up, up, up.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A201692 Number of permutations that avoid the consecutive pattern 1423.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A201693 Number of permutations that avoid the consecutive pattern 2413.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions

A230231 Number of permutations of [n] avoiding adjacent step pattern {up}^8.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A230232 Number of permutations of [n] avoiding adjacent step pattern {up}^9.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A230233 Number of permutations of [n] avoiding adjacent step pattern {up}^10.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A217057 Number of permutations in S_n containing exactly one increasing subsequence of length 4.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

A071077 Number of permutations that avoid the generalized pattern 1234-5.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula