A116392 -id:A116392 - cp's OEIS frontend

A321620 The Riordan square of the Riordan numbers, triangle read by rows, T(n, k) for 0 <= k <= n.

1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 3, 5, 5, 3, 1, 1, 6, 13, 10, 7, 4, 1, 1, 15, 29, 26, 16, 9, 5, 1, 1, 36, 73, 61, 42, 23, 11, 6, 1, 1, 91, 181, 157, 103, 61, 31, 13, 7, 1, 1, 232, 465, 398, 271, 156, 83, 40, 15, 8, 1, 1, 603, 1205, 1040, 702, 419, 221, 108, 50, 17, 9, 1, 1

Offset: 0

Peter Luschny, Nov 15 2018

If gf is a generating function of the sequence a then by the 'Riordan square of a' we understand the integer triangle given by the Riordan array (gf, gf). This mapping can be seen as an operator RS: Z[[x]] -> Mat[Z].
For instance A039599 is the Riordan square of the Catalan numbers, A172094 is the Riordan square of the little Schröder numbers and A063967 is the Riordan square of the Fibonacci numbers. The Riordan square of the simplest sequence of positive numbers (A000012) is the Pascal triangle.
The generating functions used are listed in the table below. They may differ slightly from those defined elsewhere in order to ensure that RS(a) is invertible (as a matrix). We understand this as a kind of normalization.
  ---------------------------------------------------------------------------
  Sequence a         | RS(a)   | gf(a)
  ---------------------------------------------------------------------------
  Catalan            | A039599 | (1 - sqrt(1 - 4*x))/(2*x).
  1, Riordan         | A321620 | 1 + 2*x/(1 + x + sqrt(1 - 2*x - 3*x^2)).
  Motzkin            | A321621 | (1 - x - sqrt(1 - 2*x - 3*x^2))/(2*x^2).
  Fine               | A321622 | 1 + (1 - sqrt(1 - 4*x))/(3 - sqrt(1 - 4*x)).
  large Schröder     | A321623 | (1 - x - sqrt(1 - 6*x + x^2))/(2*x).
  little Schröder    | A172094 | (1 + x - sqrt(1 - 6*x + x^2))/(4*x).
  Lucas              | A321624 | 1 + x*(1 + 2*x)/(1 - x - x^2).
  swinging factorial | A321625 | (1 + x/(1 - 4*x^2))/sqrt(1 - 4*x^2).
  ternary trees      ||A109956|| u = sqrt(x*3/4); sin(arcsin(3*u)/3)/u.
  central trinomial  | A116392 | 1/sqrt(1 - 2*x - 3*x^2)
  Bell               | A154380 | Sum_{k>=0} x^k/Product_{j=1..k}(1 - j*x).
  (2*n-1)!!          | A321627 | 1/(1-x/(1-2*x/(1-3*x/(1-4*x/(1-5*x/...
  powers of 2        | A038208 | 1/(1 - 2*x).
  the all 1's seq.   | A007318 | 1/(1 - x).
  Fibonacci          | A063967 | 1/(1 - x - x^2).
  tribonacci         | A187889 | 1/(1 - x - x^2 - x^3).
  tetranacci         | A353593 | 1/(1 - x - x^2 - x^3 - x^4).
  Jacobsthal         | A322942 | (2*x^2-1)/((x + 1)*(2*x - 1))

			The triangle starts:
   [ 0]   1
   [ 1]   1    1
   [ 2]   0    1    1
   [ 3]   1    1    1   1
   [ 4]   1    3    2   1   1
   [ 5]   3    5    5   3   1   1
   [ 6]   6   13   10   7   4   1   1
   [ 7]  15   29   26  16   9   5   1  1
   [ 8]  36   73   61  42  23  11   6  1  1
   [ 9]  91  181  157 103  61  31  13  7  1 1
   [10] 232  465  398 271 156  83  40 15  8 1 1

Peter Luschny, The Riordan Square Transform, 2018.

Row sums are A007971 and |A167022| shifted one place left.

Cf. A039599, A321621, A321622, A321624, A172094, A321623, A321624, A321625, A109956, A154380, A038208, A007318, A063967, A187889, A321629, A322942, A236376.

RiordanSquare := proc(d, n, exp:=false) local td, M, k, m, u, j;
    series(d, x, n+1); td := [seq(coeff(%, x, j), j = 0..n)];
    M := Matrix(n); for k from 1 to n do M[k, 1] := td[k] od;
    for k from 1 to n-1 do for m from k to n-1 do
       M[m+1, k+1] := add(M[j, k]*td[m-j+2], j = k..m) od od;
    if exp then u := 1;
       for k from 1 to n-1 do u := u * k;
          for m from 1 to k do j := `if`(m = 1, u, j/(m-1));
             M[k+1, m] := M[k+1, m] * j od od fi;
M end:
RiordanSquare(1 + 2*x/(1 + x + sqrt(1 - 2*x - 3*x^2)), 8);

RiordanSquare[gf_, len_] := Module[{T}, T[n_, k_] := T[n, k] = If[k == 0, SeriesCoefficient[gf, {x, 0, n}], Sum[T[j, k-1] T[n-j, 0], {j, k-1, n-1}]]; Table[T[n, k], {n, 0, len-1}, {k, 0, n}]];
M = RiordanSquare[1 + 2x/(1 + x + Sqrt[1 - 2x - 3x^2]), 12];
M // Flatten (* Jean-François Alcover, Nov 24 2018 *)

# uses[riordan_array from A256893]
def riordan_square(gf, len, exp=false):
    return riordan_array(gf, gf, len, exp)
riordan_square(1 + 2*x/(1 + x + sqrt(1 - 2*x - 3*x^2)), 10)
# Alternatively, given a list S:
def riordan_square_array(S):
    N = len(S)
    M = matrix(ZZ, N, N)
    for n in (0..N-1): M[n, 0] = S[n]
    for k in (1..N-1):
        for m in (k..N-1):
            M[m, k] = sum(M[j, k-1]*S[m-j] for j in (k-1..m-1))
    return M
riordan_square_array([1, 1, 0, 1, 1, 3, 6, 15, 36]) # Peter Luschny, Apr 03 2020

Given a generating function g and an positive integer N compute the Taylor expansion at the origin t(k) = [x^k] g(x) for k in [0...N-1] and set T(n, 0) = t(n) for n in [0...N-1]. Then compute T(m, k) = Sum_{j in [k-1...m-1]} T(j, k - 1) t(m - j) for k in [1...N-1] and for m in [k...N-1]. The resulting (0, 0)-based lower triangular array is the Riordan square generated by g.

A116389 Riordan array (1/sqrt(1-4x^2), (1+x)/sqrt(1-4x^2) -1).

Original entry on oeis.org

1, 0, 1, 2, 2, 1, 0, 4, 4, 1, 6, 10, 10, 6, 1, 0, 16, 28, 20, 8, 1, 20, 44, 62, 62, 34, 10, 1, 0, 64, 152, 168, 120, 52, 12, 1, 70, 186, 328, 436, 374, 210, 74, 14, 1, 0, 256, 748, 1084, 1072, 736, 340, 100, 16, 1, 252, 772, 1606, 2598, 2924, 2332, 1326, 518, 130, 18, 1

Offset: 0

Paul Barry, Feb 12 2006

			Triangle begins:
   1;
   0,  1;
   2,  2,  1;
   0,  4,  4,  1;
   6, 10, 10,  6,  1;
   0, 16, 28, 20,  8,  1;
  20, 44, 62, 62, 34, 10, 1;

G. C. Greubel, Rows n = 0..100 of triangle, flattened

Row sums are A116390. Diagonal sums are A116391.

Product of A007318 and this sequence is A116392.

[[(&+[ (&+[ Round((-1)^(k-j)*4^r*Binomial(k,j)*Binomial(j, n-2*r)*Gamma(r+(j+1)/2)/(Factorial(r)*Gamma((j+1)/2))) : r in [0..Floor(n/2)]]) : j in [0..k]]) : k in [0..n]]: n in [0..10]]; // G. C. Greubel, May 23 2019

T[n_,k_]:= Sum[(-1)^(k-j)*Binomial[k,j]*Sum[4^r*Binomial[r+(j-1)/2, r]* Binomial[j, n-2*r], {r,0,Floor[n/2]}], {j,0,k}]; Table[T[n,k], {n,0,10}, {k,0,n}]//Flatten (* G. C. Greubel, May 23 2019 *)

{T(n,k) = sum(j=0,k, sum(r=0,floor(n/2), (-1)^(k-j)*4^r* binomial(k,j)*binomial(r+(j-1)/2, r)*binomial(j, n-2*r) ))}; \\ G. C. Greubel, May 23 2019

[[sum( sum( (-1)^(k-j)*4^r* binomial(k,j)*binomial(r+(j-1)/2, r)*binomial(j, n-2*r) for r in (0..floor(n/2))) for j in (0..k)) for k in (0..n)] for n in (0..10)] # G. C. Greubel, May 23 2019

T(n,k) = Sum_{j=0..k} (-1)^(k-j)*C(k,j) * Sum_{i=0..floor(n/2)} 4^i * C(i+(j-1)/2, i)*C(j,n-2*i).

A115967 Expansion of 1/(2sqrt(1-2x-3*x^2) - 1).

Original entry on oeis.org

1, 2, 8, 28, 104, 384, 1428, 5316, 19820, 73948, 276044, 1030796, 3850048, 14382248, 53732172, 200759004, 750134520, 2802980640, 10474015164, 39139487292, 146259311592, 546558514368, 2042458815324, 7632600834924, 28522903136796

Offset: 0

Paul Barry, Feb 03 2006

Row sums of number triangle A116392.

Vincenzo Librandi, Table of n, a(n) for n = 0..200

R:=PowerSeriesRing(Rationals(), 30); Coefficients(R!( (1 + 2*Sqrt(1-2*x-3*x^2))/(3-8*x-12*x^2) )); // G. C. Greubel, May 06 2019

CoefficientList[ Series[1/(2 Sqrt[1-2x-3x^2]-1), {x, 0, 30}], x] (* Robert G. Wilson v, Feb 28 2012 *)

my(x='x+O('x^30)); Vec((1 + 2*sqrt(1-2*x-3*x^2))/(3-8*x-12*x^2)) \\ G. C. Greubel, May 06 2019

((1 + 2*sqrt(1-2*x-3*x^2))/(3-8*x-12*x^2)).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, May 06 2019

a(n) = Sum_{k=0..n} A116392(n,k).
G.f.: A(x)/(2 - A(x)) where A(x) is the g.f. of the central trinomial coefficients A002426.
G.f.: (1 + 2*sqrt(1-2*x-3*x^2))/(3-8*x-12*x^2).
Hankel transform is A000302, A000302(n)=4^n. - Philippe Deléham, Jun 22 2007
G.f.: 1/(2*sqrt(1-2*x-3*x^2) - 1) = 1/(1 - 2*x/G(0)); G(k)=  1 - 2*x/(1 + x/(1 + x/(1 - 2*x/(1 - x/(2 - x/G(k+1)))))); (continued fraction, 6-step). - Sergei N. Gladkovskii, Feb 27 2012
Conjecture: 3*n*a(n) + (-14*n+9)*a(n-1) + (-5*n+3)*a(n-2) + 12*(4*n-9)* a(n-3) + 36*(n-3)*a(n-4) = 0. - R. J. Mathar, Nov 15 2012
a(n) ~ (1/9 + 2/(9*sqrt(13))) * (4+2*sqrt(13))^n / 3^(n-1). - Vaclav Kotesovec, Feb 08 2014

Entry revised by N. J. A. Sloane, Apr 10 2006

A116394 Expansion of 1/((1+x)sqrt(1-2x-3*x^2) - x).

Original entry on oeis.org

1, 1, 4, 11, 33, 100, 305, 937, 2890, 8943, 27741, 86216, 268355, 836297, 2608818, 8144875, 25446229, 79545148, 248780979, 778400001, 2436380402, 7628211951, 23890103153, 74836927720, 234478937321, 734802907841, 2303073316042

Offset: 0

Paul Barry, Feb 12 2006

G. C. Greubel, Table of n, a(n) for n = 0..1000

Diagonal sums of number triangle A116392.

R:=PowerSeriesRing(Rationals(), 30); Coefficients(R!( 1/((1+x)*Sqrt(1-2*x-3*x^2) - x) )); // G. C. Greubel, May 28 2019

CoefficientList[Series[1/((1+x)*Sqrt[1-2x-3x^2] -x), {x, 0, 30}], x] (* G. C. Greubel, May 28 2019 *)

my(x='x+O('x^30)); Vec(1/((1+x)*sqrt(1-2*x-3*x^2) - x)) \\ G. C. Greubel, May 28 2019

(1/((1+x)*sqrt(1-2*x-3*x^2) - x)).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, May 28 2019

a(n) = Sum_{k=0..floor(n/2)} A116392(n-k,k).

D-finite with recurrence: n*a(n) +2*(-n+1)*a(n-1) +2*(-5*n+6)*a(n-2) +2*(3*n-7)*a(n-3) +2*(17*n-50)*a(n-4) +6*(5*n-17)*a(n-5) +9*(n-4)*a(n-6)=0. - R. J. Mathar, Jan 23 2020

cp's OEIS Frontend

A321620 The Riordan square of the Riordan numbers, triangle read by rows, T(n, k) for 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

A116389 Riordan array (1/sqrt(1-4*x^2), (1+x)/sqrt(1-4*x^2) -1).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A115967 Expansion of 1/(2*sqrt(1-2*x-3*x^2) - 1).

Views

Author

Keywords

Comments

Links

Programs

Magma

Mathematica

PARI

Sage

Formula

Extensions

A116394 Expansion of 1/((1+x)*sqrt(1-2*x-3*x^2) - x).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A116389 Riordan array (1/sqrt(1-4x^2), (1+x)/sqrt(1-4x^2) -1).

A115967 Expansion of 1/(2sqrt(1-2x-3*x^2) - 1).

A116394 Expansion of 1/((1+x)sqrt(1-2x-3*x^2) - x).