A006012 -id:A006012 - cp's OEIS frontend

A140070 Triangle read by rows, iterates of matrix X * [1,0,0,0,...], where X = an infinite lower bidiagonal matrix with [1,3,1,3,1,3,...] in the main diagonal and [1,1,1,...] in the subdiagonal.

1, 1, 1, 1, 4, 1, 1, 13, 5, 1, 1, 40, 18, 8, 1, 1, 121, 58, 42, 9, 1, 1, 364, 179, 184, 51, 12, 1, 1, 1093, 543, 731, 235, 87, 13, 1, 1, 3280, 1636, 2736, 966, 496, 100, 16, 1, 1, 9841, 4916, 9844, 3702, 2454, 596, 148, 17, 1, 1, 29524, 14757, 34448, 13546, 11064, 3050, 1040, 165, 20, 1

Offset: 1

Gary W. Adamson, May 04 2008

Row sums = A006012: (1, 2, 6, 20, 68, 232, 792, 2704,...).

Companion to triangle A140071.

			First few rows of the triangle are:
  1;
  1,    1;
  1,    4,    1;
  1,   13,    5,    1;
  1,   40,   18,    8,   1;
  1,  121,   58,   42,   9,   1;
  1,  364,  179,  184,  51,  12,   1;
  1, 1093,  543,  731, 235,  87,  13,  1;
  1, 3280, 1636, 2736, 966, 496, 100, 16, 1;
  ...

Cf. A006012, A140071, A157751.

T:= proc(n, k) option remember;
      `if`(k<0 or k>n, 0, `if`(k=0 or k=n, 1,
      4*T(n-1, k) - 3*T(n-2, k) + T(n-2, k-2)))
    end:
seq(seq(T(n, k), k=0..n), n=0..10);  # Alois P. Heinz, Feb 18 2020

With[{m = 10}, CoefficientList[CoefficientList[Series[(1 + (y - 3)*x)/(1 - 4*x - (y^2 - 3)*x^2), {x, 0, m}, {y, 0, m}], x], y]] // Flatten (* Georg Fischer, Feb 18 2020 *)

Triangle read by rows, iterates of matrix X * [1,0,0,0,...], where X = an infinite lower bidiagonal matrix with [1,3,1,3,1,3,...] in the main diagonal and [1,1,1,...] in the subdiagonal; with the rest zeros.
From Peter Bala, Jan 17 2014: (Start)
O.g.f.: (1 + (x - 3)*z)/(1 - 4*z - (x^2 - 3)*z^2) = 1 + (x + 1)*z + (x^2 + 4*x + 1)*z^2 + ....
Recurrence equation: T(n,k) = 4*T(n-1,k) - 3*T(n-2,k) + T(n-2,k-2).
Recurrence equation for row polynomials: R(n,x) = 4*R(n-1,x) + (x^2 - 3)*R(n-2,x) with R(0,x) = 1 and R(1,x) = 1 + x.
Another recurrence equation: R(n,x) = (x + 2)*R(n-1,x) - R(n-1,-x) with R(0,x) = 1. Cf. A157751. (End)

A165241 Triangle T(n,k), 0 <= k <= n, read by rows, given by [1,1,0,0,0,0,0,0,0,...] DELTA [1,0,1,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.

Original entry on oeis.org

1, 1, 1, 2, 3, 1, 4, 9, 6, 1, 8, 24, 25, 10, 1, 16, 60, 85, 55, 15, 1, 32, 144, 258, 231, 105, 21, 1, 64, 336, 728, 833, 532, 182, 28, 1, 128, 768, 1952, 2720, 2241, 1092, 294, 36, 1, 256, 1728, 5040, 8280, 8361, 5301, 2058, 450, 45, 1

Offset: 0

Philippe Deléham, Sep 09 2009

Rows sums: A006012; Diagonal sums: A052960.

The sums of each column of A117317 with its subsequent column, treated as a lower triangular matrix with an initial null column attached, or, equivalently, the products of the row polynomials p(n,y) of A117317 with (1+y) with the initial first row below added to the final result. The reversal of A117317 is A056242 with several combinatorial interpretations. - Tom Copeland, Jan 08 2017

			Triangle begins:
  1;
  1,  1;
  2,  3,  1;
  4,  9,  6,  1;
  8, 24, 25, 10,  1; ...

Cf. A000012, A000217, A005582, A011782, A084858.

Cf. A056242, A117317.

Sum_{k=0..n} T(n,k)*x^k = A009116(n), A000007(n), A011782(n), A006012(n), A083881(n), A081335(n), A090139(n), A145301(n), A145302(n), A145303(n), A143079(n) for x = -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, respectively. Sum_{k=0..n} T(n,k)*x^(n-k) = A123335(n), A000007(n), A000012(n), A006012(n), A084120(n), A090965(n), A165225(n), A165229(n), A165230(n), A165231(n), A165232(n) for x = -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, respectively.
G.f.: (1-(1+y)*x)/(1-2(1+y)*x+(y+y^2)*x^2). - Philippe Deléham, Dec 19 2011
T(n,k) = 2*T(n-1,k) + 2*T(n-1,k-1) - T(n-2,k-1) - T(n-2,k-2) with T(0,0) = T(1,0) = T(1,1) = 1 and T(n,k) = 0 if k<0 or if nPhilippe Deléham, Dec 19 2011

O.g.f. corrected by Tom Copeland, Jan 15 2017

A210217 Triangle of coefficients of polynomials u(n,x) jointly generated with A210218; see the Formula section.

Original entry on oeis.org

1, 2, 1, 2, 5, 1, 2, 6, 12, 1, 2, 6, 19, 27, 1, 2, 6, 20, 57, 58, 1, 2, 6, 20, 67, 160, 121, 1, 2, 6, 20, 68, 218, 424, 248, 1, 2, 6, 20, 68, 231, 680, 1073, 503, 1, 2, 6, 20, 68, 232, 775, 2028, 2619, 1014, 1, 2, 6, 20, 68, 232, 791, 2543, 5797, 6214, 2037, 1, 2

Offset: 1

Clark Kimberling, Mar 19 2012

Limiting row:  A006012
Row sums: even-indexed Fibonacci numbers: 1,3,8,21,...
For a discussion and guide to related arrays, see A208510.

			First five rows:
1
2...1
2...5...1
2...6...12...1
2...6...19...27...1
First three polynomials u(n,x): 1, 2 + x, 2 + 5x + x^2.

Cf. A210218, A208510.

u[1, x_] := 1; v[1, x_] := 1; z = 16;
u[n_, x_] := x*u[n - 1, x] + v[n - 1, x] + 1;
v[n_, x_] := x*u[n - 1, x] + 2 x*v[n - 1, x] + 1;
Table[Expand[u[n, x]], {n, 1, z/2}]
Table[Expand[v[n, x]], {n, 1, z/2}]
cu = Table[CoefficientList[u[n, x], x], {n, 1, z}];
TableForm[cu]
Flatten[%]    (* A210217 *)
Table[Expand[v[n, x]], {n, 1, z}]
cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
TableForm[cv]
Flatten[%]     (* A210218 *)

u(n,x)=x*u(n-1,x)+v(n-1,x)+1,
v(n,x)=x*u(n-1,x)+2x*v(n-1,x)+1,
where u(1,x)=1, v(1,x)=1.

A363809 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, and 2-1-3-5-4.

Original entry on oeis.org

1, 1, 2, 6, 22, 89, 378, 1647, 7286, 32574, 146866, 667088, 3050619, 14039075, 64992280, 302546718, 1415691181, 6656285609, 31436228056, 149079962872, 709680131574, 3390269807364, 16248661836019, 78109838535141, 376531187219762, 1819760165454501

Offset: 0

Andrei Asinowski, Jun 23 2023

nonn

Equivalently, for n>0, the number of separable permutations of [n] that avoid 2-1-3-5-4.

The number of guillotine rectangulations (with respect to the weak equivalence) that avoid the geometric pattern "7". See the Merino and Mütze reference, Table 3, entry "12347".

Andrei Asinowski and Cyril Banderier. Geometry meets generating functions: Rectangulations and permutations (2023).

Andrei Asinowski and Cyril Banderier, From geometry to generating functions: rectangulations and permutations, arXiv:2401.05558 [cs.DM], 2024. See page 2.
Arturo Merino and Torsten Mütze. Combinatorial generation via permutation languages. III. Rectangulations. Discrete & Computational Geometry, 70 (2023), 51-122. Preprint: arXiv:2103.09333 [math.CO], 2021.

Other entries including the patterns 1, 2, 3, 4 in the Merino and Mütze reference: A006318, A106228, A078482, A033321, A363810, A363811, A363812, A363813, A006012.

The generating function F=F(x) satisfies the equation x^4*(x - 2)^2*F^4 + x*(x - 2)*(4*x^3 - 7*x^2 + 6*x - 1)*F^3 + (2*x^4 - x^3 - 2*x^2 + 5*x - 1)*F^2 - (4*x^3 - 7*x^2 + 6*x - 1)*F + x^2 = 0.

A363810 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-14-3, and 4-5-3-1-2.

Original entry on oeis.org

1, 1, 2, 6, 21, 79, 306, 1196, 4681, 18308, 71564, 279820, 1095533, 4298463, 16913428, 66769536, 264526329, 1051845461, 4197832133, 16813161765, 67571221016, 272448598737, 1101876945673, 4469106749281, 18174503562880, 74093063050412, 302753929958872

Offset: 0

Andrei Asinowski, Jun 23 2023

nonn

Equivalently, for n>0, the number of separable permutations of [n] that avoid 2-14-3 and 2-1-3-5-4.

The number of guillotine rectangulations (with respect to the weak equivalence) that avoid the geometric patterns "5" and "8". See the Merino and Mütze reference, Table 3, entry "123458".

Andrei Asinowski and Cyril Banderier, From geometry to generating functions: rectangulations and permutations, arXiv:2401.05558 [cs.DM], 2024. See page 2.
Arturo Merino and Torsten Mütze. Combinatorial generation via permutation languages. III. Rectangulations. Discrete & Computational Geometry, 70 (2023), 51-122. Preprint: arXiv:2103.09333 [math.CO], 2021.

Other entries including the patterns 1, 2, 3, 4 in the Merino and Mütze reference: A006318, A106228, A363809, A078482, A033321, A363811, A363812, A363813, A006012.

with(gfun): seq(coeff(algeqtoseries(x^8*(-2+x)^2*F^4 - x^3*(x-1)*(-2+x)*(x^5-7*x^4+4*x^3-6*x^2+5*x-1)*F^3 - x*(x-1)*(4*x^7-22*x^6+37*x^5-42*x^4+53*x^3-35*x^2+10*x-1)*F^2 - (5*x^6-16*x^5+15*x^4-28*x^3+23*x^2-8*x+1)*(x-1)^2*F - (2*x^5-5*x^4+4*x^3-10*x^2+6*x-1)*(x-1)^2, x, F, 32, true)[1], x, n+1), n = 0..30); # Vaclav Kotesovec, Jun 24 2023

The generating function F=F(x) satisfies the equation x^8*(x - 2)^2*F^4 - x^3*(x - 1)*(x - 2)*(x^5 - 7*x^4 + 4*x^3 - 6*x^2 + 5*x - 1)*F^3 - x*(x - 1)*(4*x^7 - 22*x^6 + 37*x^5 - 42*x^4 + 53*x^3 - 35*x^2 + 10*x - 1)*F^2 - (5*x^6 - 16*x^5 + 15*x^4 - 28*x^3 + 23*x^2 - 8*x + 1)*(x - 1)^2*F - (2*x^5 - 5*x^4 + 4*x^3 - 10*x^2 + 6*x - 1)*(x - 1)^2 = 0.

A363811 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-3-5-4, and 4-5-3-1-2.

Original entry on oeis.org

1, 1, 2, 6, 22, 88, 362, 1488, 6034, 24024, 93830, 359824, 1357088, 5043260, 18501562, 67120024, 241169322, 859450004, 3041415520, 10699090888, 37448249502, 130518538696, 453276141238, 1569476495000, 5420784841936, 18683861676756, 64286814548706

Offset: 0

Andrei Asinowski, Jun 23 2023

Equivalently, for n>0, the number of separable permutations of [n] that avoid 2-1-3-5-4 and 4-5-3-1-2.

The number of guillotine rectangulations (with respect to the weak equivalence) that avoid the geometric patterns "7" and "8". See the Merino and Mütze reference, Table 3, entry "123478".

Andrei Asinowski and Cyril Banderier, From geometry to generating functions: rectangulations and permutations, arXiv:2401.05558 [cs.DM], 2024. See page 2.
Arturo Merino and Torsten Mütze. Combinatorial generation via permutation languages. III. Rectangulations. Discrete & Computational Geometry, 70 (2023), 51-122. Preprint: arXiv:2103.09333 [math.CO], 2021.
Index entries for linear recurrences with constant coefficients, signature (18,-141,630,-1767,3224,-3834,2896,-1312,320,-32).

Other entries including the patterns 1, 2, 3, 4 in the Merino and Mütze reference: A006318, A106228, A363809, A078482, A033321, A363810, A363812, A363813, A006012.

CoefficientList[Series[(1 - x)*(1 - 16*x + 109*x^2 - 410*x^3 + 923*x^4 - 1256*x^5 + 988*x^6 - 400*x^7 + 66*x^8 - 2*x^9)/((1 - 4*x + 2*x^2)*(1 - 3*x + x^2)^2*(1 - 2*x)^4),{x,0,26}],x] (* Stefano Spezia, Jun 24 2023 *)

G.f.: (1 - x)*(1 - 16*x + 109*x^2 - 410*x^3 + 923*x^4 - 1256*x^5 + 988*x^6 - 400*x^7 + 66*x^8 - 2*x^9)/((1 - 4*x + 2*x^2)*(1 - 3*x + x^2)^2*(1 - 2*x)^4).

A363812 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-4-3, and 3-41-2.

Original entry on oeis.org

1, 1, 2, 6, 20, 69, 243, 870, 3159, 11611, 43130, 161691, 611065, 2325739, 8907360, 34304298, 132770564, 516164832, 2014739748, 7892775473, 31022627947, 122304167437, 483513636064, 1916394053725, 7613498804405, 30313164090695

Offset: 0

Andrei Asinowski, Jun 23 2023

Equivalently, for n>0, the number of separable permutations of [n] that avoid 2-1-4-3 and 3-41-2.

The number of guillotine rectangulations (with respect to the weak equivalence) that avoid the geometric patterns "5", "6", "7". See the Merino and Mütze reference, Table 3, entry "1234567".

Andrei Asinowski and Cyril Banderier, From geometry to generating functions: rectangulations and permutations, arXiv:2401.05558 [cs.DM], 2024. See page 2.
Arturo Merino and Torsten Mütze. Combinatorial generation via permutation languages. III. Rectangulations. Discrete & Computational Geometry, 70 (2023), 51-122. Preprint: arXiv:2103.09333 [math.CO], 2021.

Other entries including the patterns 1, 2, 3, 4 in the Merino and Mütze reference: A006318, A106228, A363809, A078482, A033321, A363810, A363811, A363813, A006012.

CoefficientList[Series[(1 - 3*x + 3*x^2 - Sqrt[1 - 6*x + 7*x^2 + 2*x^3 + x^4])/(2*x^2*(2 - x)),{x,0,25}],x] (* Stefano Spezia, Jun 24 2023 *)

G.f.: (1 - 3*x + 3*x^2 - sqrt(1 - 6*x + 7*x^2 + 2*x^3 + x^4))/(2*x^2*(2 - x)).

A363813 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-4-3, and 4-5-3-1-2.

Original entry on oeis.org

1, 1, 2, 6, 21, 78, 295, 1114, 4166, 15390, 56167, 202738, 724813, 2570276, 9052494, 31702340, 110503497, 383691578, 1328039043, 4584708230, 15793983638, 54315199642, 186526735307, 639831906594, 2192754259993, 7509139583560, 25699765092254, 87913948206096

Offset: 0

Andrei Asinowski, Jun 23 2023

Equivalently, for n>0, the number of separable permutations of [n] that avoid 2-1-4-3 and 4-5-3-1-2.

The number of guillotine rectangulations (with respect to the weak equivalence) that avoid the geometric patterns "5", "7", "8". See the Merino and Mütze reference, Table 3, entry "1234578".

Andrei Asinowski and Cyril Banderier, From geometry to generating functions: rectangulations and permutations, arXiv:2401.05558 [cs.DM], 2024. See page 2.
Arturo Merino and Torsten Mütze. Combinatorial generation via permutation languages. III. Rectangulations. Discrete & Computational Geometry, 70 (2023), 51-122. Preprint: arXiv:2103.09333 [math.CO], 2021.
Index entries for linear recurrences with constant coefficients, signature (10,-37,62,-47,16,-2).

Other entries including the patterns 1, 2, 3, 4 in the Merino and Mütze reference: A006318, A106228, A363809, A078482, A033321, A363810, A363811, A363812, A006012.

CoefficientList[Series[(1 - 9*x + 29*x^2 - 39*x^3 + 20*x^4 - 3*x^5)/((1 - 4*x + 2*x^2)*(1 - 3*x + x^2)^2),{x,0,27}],x] (* Stefano Spezia, Jun 24 2023 *)

G.f.: (1 - 9*x + 29*x^2 - 39*x^3 + 20*x^4 - 3*x^5)/((1 - 4*x + 2*x^2)*(1 - 3*x + x^2)^2).

A087161 Records in A087159, i.e., A087159(a(n)) = n, and satisfies the recurrence a(n+3) = 5a(n+2) - 6 a(n+1) + 2*a(n) with a(1) = 1, a(2) = 2, and a(3) = 4.

Original entry on oeis.org

1, 2, 4, 10, 30, 98, 330, 1122, 3826, 13058, 44578, 152194, 519618, 1774082, 6057090, 20680194, 70606594, 241065986, 823050754, 2810071042, 9594182658, 32756588546, 111837988866, 381838778370, 1303679135746, 4451038986242

Offset: 1

Paul D. Hanna, Aug 22 2003

nonn

Binomial transform of A001333 (which, with an extra leading 1, is the expansion of (1 - x - 2*x^2)/(1 - 2*x - x^2)). - Paul Barry, Aug 26 2003

Partial sums of the binomial transform of Pell(n-1). - Paul Barry, Apr 24 2004

Index entries for linear recurrences with constant coefficients, signature (5,-6,2).

Cf. A000129, A007070, A087159, A087160, A100631.

CoefficientList[Series[(1-3x)/(1-5x+6x^2-2x^3),{x,0,30}],x] (* or *) LinearRecurrence[{5,-6,2},{1,2,4},30] (* Harvey P. Dale, Oct 12 2015 *)

G.f.: x*(1 - 3*x)/(1 - 5*x + 6*x^2 - 2*x^3).
a(n) = 2 + 2*A007070(n-3) for n > 2.
a(n) = ((2 - sqrt(2))^(n)/(1 - sqrt(2)) + (2 + sqrt(2))^(n)/(1 + sqrt(2)))/2 + 2 (offset 0) - Paul Barry, Aug 26 2003
a(n+1) - a(n) = A006012(n-1) for n >= 2. - Philippe Deléham, Feb 01 2012
a(1) = 1, a(2) = 2, a(3) = 4, a(n) = 5*a(n-1) - 6*a(n-2) + 2*a(n-3) for n >= 4. - Harvey P. Dale, Oct 12 2015
a(n+1) = Sum_{k=0..n} A100631(n,k) for n >= 0. - Petros Hadjicostas, Feb 09 2021

More terms from Paul Barry, Apr 24 2004

A172455 The case S(6,-4,-1) of the family of self-convolutive recurrences studied by Martin and Kearney.

Original entry on oeis.org

1, 7, 84, 1463, 33936, 990542, 34938624, 1445713003, 68639375616, 3676366634402, 219208706540544, 14397191399702118, 1032543050697424896, 80280469685284582812, 6725557192852592984064, 603931579625379293509683

Offset: 1

N. J. A. Sloane, Nov 20 2010

nonn

			G.f. = x + 7*x^2 + 84*x^3 + 1463*x^4 + 33936*x^5 + 990542*x^6 + 34938624*x^7 + ...
a(2) = 7 since (6*2 - 4) * a(2-1) - (a(1) * a(2-1)) = 7.

Vincenzo Librandi, Table of n, a(n) for n = 1..200
R. J. Martin and M. J. Kearney, An exactly solvable self-convolutive recurrence, Aequat. Math., 80 (2010), 291-318. see p. 307.
R. J. Martin and M. J. Kearney, An exactly solvable self-convolutive recurrence, arXiv:1103.4936 [math.CO], 2011.
NIST Digital Library of Mathematical Functions, Airy Functions.
A. N. Stokes, Continued fraction solutions of the Riccati equation, Bull. Austral. Math. Soc. Vol. 25 (1982), 207-214.
Eric Weisstein's World of Mathematics, Airy Functions, contains the definitions of Ai(x), Bi(x).

Cf. A000079 S(1,1,-1), A000108 S(0,0,1), A000142 S(1,-1,0), A000244 S(2,1,-2), A000351 S(4,1,-4), A000400 S(5,1,-5), A000420 S(6,1,-6), A000698 S(2,-3,1), A001710 S(1,1,0), A001715 S(1,2,0), A001720 S(1,3,0), A001725 S(1,4,0), A001730 S(1,5,0), A003319 S(1,-2,1), A005411 S(2,-4,1), A005412 S(2,-2,1), A006012 S(-1,2,2), A006318 S(0,1,1), A047891 S(0,2,1), A049388 S(1,6,0), A051604 S(3,1,0), A051605 S(3,2,0), A051606 S(3,3,0), A051607 S(3,4,0), A051608 S(3,5,0), A051609 S(3,6,0), A051617 S(4,1,0), A051618 S(4,2,0), A051619 S(4,3,0), A051620 S(4,4,0), A051621 S(4,5,0), A051622 S(4,6,0), A051687 S(5,1,0), A051688 S(5,2,0), A051689 S(5,3,0), A051690 S(5,4,0), A051691 S(5,5,0), A053100 S(6,1,0), A053101 S(6,2,0), A053102 S(6,3,0), A053103 S(6,4,0), A053104 S(7,1,0), A053105 S(7,2,0), A053106 S(7,3,0), A062980 S(6,-8,1), A082298 S(0,3,1), A082301 S(0,4,1), A082302 S(0,5,1), A082305 S(0,6,1), A082366 S(0,7,1), A082367 S(0,8,1), A105523 S(0,-2,1), A107716 S(3,-4,1), A111529 S(1,-3,2), A111530 S(1,-4,3), A111531 S(1,-5,4), A111532 S(1,-6,5), A111533 S(1,-7,6), A111546 S(1,0,1), A111556 S(1,1,1), A143749 S(0,10,1), A146559 S(1,1,-2), A167872 S(2,-3,2), A172450 S(2,0,-1), A172485 S(-1,-2,3), A177354 S(1,2,1), A292186 S(4,-6,1), A292187 S(3, -5, 1).

a[1] = 1; a[n_]:= a[n] = (6*n-4)*a[n-1] - Sum[a[k]*a[n-k], {k, 1, n-1}]; Table[a[n], {n, 1, 20}] (* Vaclav Kotesovec, Jan 19 2015 *)

{a(n) = local(A); if( n<1, 0, A = vector(n); A[1] = 1; for( k=2, n, A[k] = (6 * k - 4) * A[k-1] - sum( j=1, k-1, A[j] * A[k-j])); A[n])} /* Michael Somos, Jul 24 2011 */

S(v1, v2, v3, N=16) = {
  my(a = vector(N)); a[1] = 1;
  for (n = 2, N, a[n] = (v1*n+v2)*a[n-1] + v3*sum(j=1,n-1,a[j]*a[n-j])); a;
};
S(6,-4,-1)
\\ test: y = x*Ser(S(6,-4,-1,201)); 6*x^2*y' == y^2 - (2*x-1)*y - x
\\ Gheorghe Coserea, May 12 2017

a(n) = (6*n - 4) * a(n-1) - Sum_{k=1..n-1} a(k) * a(n-k) if n>1. - Michael Somos, Jul 24 2011
G.f.: x / (1 - 7*x / (1 - 5*x / (1 - 13*x / (1 - 11*x / (1 - 19*x / (1 - 17*x / ... )))))). - Michael Somos, Jan 03 2013
a(n) = 3/(2*Pi^2)*int((4*x)^((3*n-1)/2)/(Ai'(x)^2+Bi'(x)^2), x=0..inf), where Ai'(x), Bi'(x) are the derivatives of the Airy functions. [Vladimir Reshetnikov, Sep 24 2013]
a(n) ~ 6^n * (n-1)! / (2*Pi) [Martin + Kearney, 2011, p.16]. - Vaclav Kotesovec, Jan 19 2015
6*x^2*y' = y^2 - (2*x-1)*y - x, where y(x) = Sum_{n>=1} a(n)*x^n. - Gheorghe Coserea, May 12 2017
G.f.: x/(1 - 2*x - 5*x/(1 - 7*x/(1 - 11*x/(1 - 13*x/(1 - ... - (6*n - 1)*x/(1 - (6*n + 1)*x/(1 - .... Cf. A062980. - Peter Bala, May 21 2017

cp's OEIS Frontend

A140070 Triangle read by rows, iterates of matrix X * [1,0,0,0,...], where X = an infinite lower bidiagonal matrix with [1,3,1,3,1,3,...] in the main diagonal and [1,1,1,...] in the subdiagonal.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A165241 Triangle T(n,k), 0 <= k <= n, read by rows, given by [1,1,0,0,0,0,0,0,0,...] DELTA [1,0,1,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Extensions

A210217 Triangle of coefficients of polynomials u(n,x) jointly generated with A210218; see the Formula section.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A363809 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, and 2-1-3-5-4.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Formula

A363810 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-14-3, and 4-5-3-1-2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Formula

A363811 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-3-5-4, and 4-5-3-1-2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A363812 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-4-3, and 3-41-2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A363813 Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-4-3, and 4-5-3-1-2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A087161 Records in A087159, i.e., A087159(a(n)) = n, and satisfies the recurrence a(n+3) = 5a(n+2) - 6 a(n+1) + 2*a(n) with a(1) = 1, a(2) = 2, and a(3) = 4.