A193843 -id:A193843 - cp's OEIS frontend

A193842 Triangular array: the fission of the polynomial sequence ((x+1)^n: n >= 0) by the polynomial sequence ((x+2)^n: n >= 0). (Fission is defined at Comments.)

1, 1, 4, 1, 7, 13, 1, 10, 34, 40, 1, 13, 64, 142, 121, 1, 16, 103, 334, 547, 364, 1, 19, 151, 643, 1549, 2005, 1093, 1, 22, 208, 1096, 3478, 6652, 7108, 3280, 1, 25, 274, 1720, 6766, 17086, 27064, 24604, 9841, 1, 28, 349, 2542, 11926, 37384, 78322, 105796

Offset: 0

Clark Kimberling, Aug 07 2011

Suppose that p = p(n)*x^n + p(n-1)*x^(n-1) + ... + p(1)*x + p(0) is a polynomial and that Q is a sequence of polynomials:
...
q(k,x) = t(k,0)*x^k + t(k,1)*x^(k-1) + ... + t(k,k-1)*x + t(k,k),
...
for k = 0, 1, 2, ...  The Q-downstep of p is the polynomial given by
...
D(p) = p(n)*q(n-1,x) + p(n-1)*q(n-2,x) + ... + p(1)*q(0,x). (Note that p(0) does not appear. "Q-downstep" as just defined differs slightly from "Q-downstep" as defined for a different purpose at A193649.)
...
Now suppose that P = (p(n,x): n >= 0) and Q = (q(n,x): n >= 0) are sequences of polynomials, where n indicates degree.  The fission of P by Q, denoted by P^^Q, is introduced here as the sequence W = (w(n,x): n >= 0) of polynomials defined by w(0,x) = 1 and w(n,x) = D(p(n+1,x)).
...
Strictly speaking, ^^ is an operation on sequences of polynomials.  However, if P and Q are regarded as numerical triangles (of coefficients of polynomials), then ^^ can be regarded as an operation on numerical triangles.  In this case, row n of P^^Q, for n > 0, is given by the matrix product P(n+1)*QQ(n), where P(n+1) =(p(n+1,n+1), p(n+1,n), ..., p(n+1,2), p(n+1,1)) and QQ(n) is the (n+1)-by-(n+1) matrix given by
...
q(n,0) .. q(n,1)............. q(n,n-1) .... q(n,n)
0 ....... q(n-1,0)........... q(n-1,n-2)... q(n-1,n-1)
0 ....... 0.................. q(n-2,n-3) .. q(n-2,n-2)
...
0 ....... 0.................. q(1,0) ...... q(1,1)
0 ....... 0 ................. 0 ........... q(0,0).
Here, the polynomial q(k,x) is taken to be
q(k,0)*x^k + q(k,1)x^(k-1) + ... + q(k,k)*x + q(k,k);
i.e., "q" is used instead of "t".
...
Example:  Let p(n,x) = (x+1)^n and q(n,x) = (x+2)^n.  Then
...
w(0,x) = 1 by the definition of W,
w(1,x) = D(p(2,x)) = 1*(x+2) + 2*1 = x + 4,
w(2,x) = D(p(3,x)) = 1*(x^2+4*x+4) + 3*(x+2) + 3*1 = x^2 + 7*x + 13,
w(3,x) = D(p(4,x)) = 1*(x^3+6*x^2+12*x+8) + 4*(x^2+4x+4) + 6*(x+2) + 4*1 = x^3 + 10*x^2 + 34*x + 40.
...
From these first 4 polynomials in the sequence P^^Q, we can write the first 4 rows of P^^Q when P, Q, and P^^Q are regarded as triangles:
1
1...4
1...7....13
1...10...34...40
...
In the following examples, r(P^^Q) is the mirror of P^^Q, obtained by reversing the rows of P^^Q.  Let u denote the polynomial x^n + x^(n-1) + ... + x + 1.
...
..P........Q...........P^^Q........r(P^^Q)
(x+1)^n....(x+2)^n.....A193842.....A193843
(x+1)^n....(x+1)^n.....A193844.....A193845
(x+2)^n....(x+1)^n.....A193846.....A193847
(2x+1)^n...(x+1)^n.....A193856.....A193857
(x+1)^n....(2x+1)^n....A193858.....A193859
(x+1)^n.......u........A054143.....A104709
..u........(x+1)^n.....A074909.....A074909
..u...........u........A002260.....A004736
(x+2)^n.......u........A193850.....A193851
..u.........(x+2)^n....A193844.....A193845
(2x+1)^n......u........A193860.....A193861
..u.........(2x+1)^n...A115068.....A193862
...
Regarding A193842,
col 1 ...... A000012
col 2 ...... A016777
col 3 ...... A081271
w(n,n) ..... A003462
w(n,n-1) ... A014915

			First six rows, for 0 <= k <= n and 0 <= n <= 5:
  1
  1...4
  1...7....13
  1...10...34....40
  1...13...64....142...121
  1...16...103...334...547...364

G. C. Greubel, Rows n = 0..100 of triangle, flattened
Digital Library of Mathematical Functions, Hypergeometric function, analytic properties.
Clark Kimberling, Fusion, Fission, and Factors, Fib. Q., 52(3) (2014), 195-202.

Cf. A193722 (fusion of P by Q), A193649 (Q-residue), A193843 (mirror of A193842).

[ (&+[3^(k-j)*Binomial(n-j,k-j): j in [0..k]]): k in [0..n], n in [0..10]]; // G. C. Greubel, Feb 18 2020

fission := proc(p, q, n) local d, k;
p(n+1,0)*q(n,x)+add(coeff(p(n+1,x),x^k)*q(n-k,x), k=1..n);
seq(coeff(%,x,n-k), k=0..n) end:
A193842_row := n -> fission((n,x) -> (x+1)^n, (n,x) -> (x+2)^n, n);
for n from 0 to 5 do A193842_row(n) od; # Peter Luschny, Jul 23 2014
# Alternatively:
p := (n,x) -> add(x^k*(1+3*x)^(n-k),k=0..n): for n from 0 to 7 do [n], PolynomialTools:-CoefficientList(p(n,x), x) od; # Peter Luschny, Jun 18 2017

(* First program *)
z = 10;
p[n_, x_] := (x + 1)^n;
q[n_, x_] := (x + 2)^n
p1[n_, k_] := Coefficient[p[n, x], x^k];
p1[n_, 0] := p[n, x] /. x -> 0;
d[n_, x_] := Sum[p1[n, k]*q[n - 1 - k, x], {k, 0, n - 1}]
h[n_] := CoefficientList[d[n, x], {x}]
TableForm[Table[Reverse[h[n]], {n, 0, z}]]
Flatten[Table[Reverse[h[n]], {n, -1, z}]]  (* A193842 *)
TableForm[Table[h[n], {n, 0, z}]]  (* A193843 *)
Flatten[Table[h[n], {n, -1, z}]]
(* Second program *)
Table[SeriesCoefficient[((x+3)^(n+1) -1)/(x+2), {x,0,n-k}], {n,0,10}, {k,0,n}]//Flatten (* G. C. Greubel, Feb 18 2020 *)

T(n,k) = sum(j=0,k, 3^(k-j)*binomial(n-j,k-j)); \\ G. C. Greubel, Feb 18 2020

from mpmath import mp, hyp2f1
mp.dps = 100; mp.pretty = True
def T(n,k):
    return 3^k*binomial(n,k)*hyp2f1(1,-k,-n,1/3)-0^(n-k)//2
for n in range(7):
    print([int(T(n,k)) for k in (0..n)]) # Peter Luschny, Jul 23 2014

# Second program using the 'fission' operation.
def fission(p, q, n):
    F = p(n+1,0)*q(n,x)+add(expand(p(n+1,x)).coefficient(x,k)*q(n-k,x) for k in (1..n))
    return [expand(F).coefficient(x,n-k) for k in (0..n)]
A193842_row = lambda k: fission(lambda n,x: (x+1)^n, lambda n,x: (x+2)^n, k)
for n in range(7): A193842_row(n) # Peter Luschny, Jul 23 2014

From Peter Bala, Jul 16 2013: (Start)
T(n,k) = Sum_{i = 0..k} 3^(k-i)*binomial(n-i,k-i).
O.g.f.: 1/((1 - x*t)*(1 - (1 + 3*x)*t)) = 1 + (1 + 4*x)*t + (1 + 7*x + 13*x^2)*t^2 + ....
The n-th row polynomial is R(n,x) = (1/(2*x + 1))*((3*x + 1)^(n+1) - x^(n+1)). (End)
T(n,k) = T(n-1,k) + 4*T(n-1,k-1) - T(n-2,k-1) - 3*T(n-2,k-2), T(0,0) = 1, T(1,0) = 1, T(1,1) = 4, T(n,k) = 0 if k < 0 or if k > n. - Philippe Deléham, Jan 17 2014
T(n,k) = 3^k * C(n,k) * hyp2F1(1, -k, -n, 1/3) with or without the additional term -0^(n-k)/2 depending on the exact definition of the hypergeometric function used. Compare formulas 15.2.5 and 15.2.6 in the DLMF reference. - Peter Luschny, Jul 23 2014

Name and Comments edited by Petros Hadjicostas, Jun 05 2020

A111577 Galton triangle T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k) read by rows.

Original entry on oeis.org

1, 1, 1, 1, 5, 1, 1, 21, 12, 1, 1, 85, 105, 22, 1, 1, 341, 820, 325, 35, 1, 1, 1365, 6081, 4070, 780, 51, 1, 1, 5461, 43932, 46781, 14210, 1596, 70, 1, 1, 21845, 312985, 511742, 231511, 39746, 2926, 92, 1, 1, 87381, 2212740, 5430405, 3521385, 867447, 95340, 4950, 117, 1

Offset: 1

Gary W. Adamson, Aug 07 2005

In triangles of analogs to Stirling numbers of the second kind, the multipliers of T(n-1,k) in the recurrence are terms in arithmetic sequences: in Pascal's triangle A007318, the multiplier = 1. In triangle A008277, the Stirling numbers of the second kind, the multipliers are in the set (1,2,3...). For this sequence here, the multipliers are from A016777.
Riordan array [exp(x), (exp(3x)-1)/3]. - Paul Barry, Nov 26 2008
From Peter Bala, Jan 27 2015: (Start)
Working with an offset of 0, this is the triangle of connection constants between the polynomial basis sequences {x^n}, n>=0 and {n!*3^n*binomial((x - 1)/3,n)}, n>=0. An example is given below.
Call this array M and let P denote Pascal's triangle A007318, then P * M = A225468, P^2 * M = A075498. Also P^(-1) * M is a shifted version of A075498.
This triangle is the particular case a = 3, b = 0, c = 1 of the triangle of generalized Stirling numbers of the second kind S(a,b,c) defined in the Bala link. (End)
Named after the English scientist Francis Galton (1822-1911). - Amiram Eldar, Jun 13 2021
This is the array of (r, β)-Stirling numbers for r = 1 and β = 3. See Corcino. - Peter Bala, Feb 26 2025

			T(5,3) = T(4,2) + 7*T(4,3) = 21 + 7*12 = 105.
The triangle starts in row n = 1 as:
  1;
  1,  1;
  1,  5,   1;
  1, 21,  12,  1;
  1, 85, 105, 22, 1;
Connection constants: Row 4: [1, 21, 12, 1] so
x^3 = 1 + 21*(x - 1) + 12*(x - 1)*(x - 4) + (x - 1)*(x - 4)*(x - 7). - _Peter Bala_, Jan 27 2015
From _Peter Bala_, Feb 26 2025: (Start)
The array factorizes as
/1                \     /1               \/1              \/1             \
|1   1            |     |1   1           ||0  1           ||0  1          |
|1   5    1       |  =  |1   4   1       ||0  1   1       ||0  0  1       | ...
|1  21   12   1   |     |1  13   7   1   ||0  1   4  1    ||0  0  1  1    |
|1  85  105  22  1|     |1  44  34  10  1||0  1  13  7  1 ||0  0  1  4  1 |
|...              |     |...             ||...            ||...           |
where, in the infinite product on the right-hand side, the first array is the Riordan array (1/(1 - x), x/(1 - 3*x)). Cf. A193843. (End)

Peter Bala, A 3 parameter family of generalized Stirling numbers, 2015.
Peter Bala, Factorising (r,b)-Stirling arrays
Roberto B. Corcino, The (r, β)-Stirling Numbers, The Mindanao Forum, Vol. XIV, No.2, pp. 91-99, 1999.
Paweł Hitczenko, A class of polynomial recurrences resulting in (n/log n, n/log^2 n)-asymptotic normality, arXiv:2403.03422 [math.CO], 2024. See p. 8.
Ruedi Suter, Two Analogues of a Classical Sequence, Journal of Integer Sequences, Vol. 3 (2000), Article 00.1.8. [_Paul Barry_, Nov 26 2008]

Cf. A008277, A039755, A075498, A225468.

Cf. A282629, A284861, A225117.

A111577 := proc(n,k) option remember; if k = 1 or k = n then 1; else procname(n-1,k-1)+(3*k-2)*procname(n-1,k) ; fi; end:
seq( seq(A111577(n,k),k=1..n), n=1..10) ; # R. J. Mathar, Aug 22 2009

T[, 1] = 1; T[n, n_] = 1;
T[n_, k_] := T[n, k] = T[n-1, k-1] + (3k-2) T[n-1, k];
Table[T[n, k], {n, 1, 10}, {k, 1, n}] (* Jean-François Alcover, Jun 13 2019 *)

T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k).
E.g.f.: exp(x)*exp((y/3)*(exp(3x)-1)). - Paul Barry, Nov 26 2008
Let f(x) = exp(1/3*exp(3*x) + x). Then, with an offset of 0, the row polynomials R(n,x) are given by R(n,exp(3*x)) = 1/f(x)*(d/dx)^n(f(x)). Similar formulas hold for A008277, A039755, A105794, A143494 and A154537. - Peter Bala, Mar 01 2012
T(n, k) = 1/(3^k*k!)*Sum_{j=0..k}((-1)^(k-j)*binomial(k,j)*(3*j+1)^n). - Peter Luschny, May 20 2013
From Peter Bala, Jan 27 2015: (Start)
T(n,k) = Sum_{i = 0..n-1} 3^(i-k+1)*binomial(n-1,i)*Stirling2(i,k-1).
O.g.f. for n-th diagonal: exp(-x/3)*Sum_{k >= 0} (3*k + 1)^(k+n-1)*((x/3*exp(-x))^k)/k!.
O.g.f. column k (with offset 0): 1/( (1 - x)*(1 - 4*x)*...*(1 - (3*k + 1)*x) ). (End)

Edited and extended by R. J. Mathar, Aug 22 2009

A248811 Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x+3)^k for 0 <= k <= n.

Original entry on oeis.org

1, -2, 1, 7, -5, 1, -20, 22, -8, 1, 61, -86, 46, -11, 1, -182, 319, -224, 79, -14, 1, 547, -1139, 991, -461, 121, -17, 1, -1640, 3964, -4112, 2374, -824, 172, -20, 1, 4921, -13532, 16300, -11234, 4846, -1340, 232, -23, 1, -14762, 45517, -62432, 50002, -25772, 8866, -2036, 301, -26, 1, 44287, -151313, 232813, -212438, 127318, -52370, 14974, -2939, 379, -29, 1

Offset: 0

Derek Orr, Oct 14 2014

Consider the transformation 1 + x + x^2 + x^3 + ... + x^n = A_0*(x+3)^0 + A_1*(x+3)^1 + A_2*(x+3)^2 + ... + A_n*(x+3)^n. This sequence gives A_0, ..., A_n as the entries in the n-th row of this triangle, starting at n = 0.

			       1;
      -2,       1;
       7,      -5,      1;
     -20,      22,     -8,       1;
      61,     -86,     46,     -11,      1;
    -182,     319,   -224,      79,    -14,      1;
     547,   -1139,    991,    -461,    121,    -17,     1;
   -1640,    3964,  -4112,    2374,   -824,    172,   -20,     1;
    4921,  -13532,  16300,  -11234,   4846,  -1340,   232,   -23,   1;
  -14762,   45517, -62432,   50002, -25772,   8866, -2036,   301, -26,   1;
   44287, -151313, 232813, -212438, 127318, -52370, 14974, -2939, 379, -29, 1;

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

Cf. A193843, A077925, A191008, A014983.

[[(&+[(-3)^(j-k)*Binomial(j,k): j in [0..n]]): k in [0..n]]: n in [0..20]]; // G. C. Greubel, May 27 2018

T[n_, k_]:= Sum[(-3)^(j-k)*Binomial[j,k], {j,0,n}]; Table[T[n, k], {n, 0, 10}, {k, 0, n}]//Flatten (* G. C. Greubel, May 27 2018 *)

for(n=0,20,for(k=0,n,print1(sum(i=0,n,((-3)^(i-k)* binomial(i, k)) ),", ")))

T(n,n-1) = -3*n + 1 for n > 0.
T(n,0) = A014983(n+1).
T(n,1) = (-1)^(n+1)*A191008(n-1).
Row n sums to A077925(n).

A248978 Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x-3k)^k for 0 <= k <= n.

Original entry on oeis.org

1, 4, 1, 4, 13, 1, 4, 94, 28, 1, 4, 526, 460, 49, 1, 4, 2551, 5860, 1399, 76, 1, 4, 11299, 64180, 30559, 3316, 109, 1, 4, 47020, 635716, 566374, 109156, 6724, 148, 1, 4, 186988, 5861188, 9384358, 3012196, 309124, 12244, 193, 1, 4, 718429, 51210820, 143307490, 73556068, 11790874, 747076, 20605, 244, 1, 4, 2686729, 429124420, 2056495090, 1641197668, 394515874, 37488676, 1608205, 32644, 301, 1

Offset: 0

Derek Orr, Oct 18 2014

Consider the transformation 1 + x + x^2 + x^3 + ... + x^n = A_0*(x-0)^0 + A_1*(x-3)^1 + A_2*(x-6)^2 + ... + A_n*(x-3n)^n. This sequence gives A_0, ... A_n as the entries in the n-th row of this triangle, starting at n = 0.

			1;
4,      1;
4,     13,        1;
4,     94,       28,         1;
4,    526,      460,        49,        1;
4,   2551,     5860,      1399,       76,        1;
4,  11299,    64180,     30559,     3316,      109,      1;
4,  47020,   635716,    566374,   109156,     6724,    148,     1;
4, 186988,  5861188,   9384358,  3012196,   309124,  12244,   193,   1;
4, 718429, 51210820, 143307490, 73556068, 11790874, 747076, 20605, 244, 1;

Cf. A248977, A248830, A242598, A193843, A153703, A056107.

for(n=0, 10, for(k=0, n, if(!k, if(n, print1(4, ", ")); if(!n, print1(1, ", "))); if(k, print1(sum(i=1, n, ((3*k)^(i-k)*i*binomial(i,k)))/k, ", "))))

T(n,n-1) = 1 + 3n^2 for n > 0.

T(n,1) = (3^n*(n^2-n+1)-1)/2 for n > 0.

cp's OEIS Frontend

A193842 Triangular array: the fission of the polynomial sequence ((x+1)^n: n >= 0) by the polynomial sequence ((x+2)^n: n >= 0). (Fission is defined at Comments.)

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Sage

Formula

Extensions

A111577 Galton triangle T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k) read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A248811 Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x+3)^k for 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A248978 Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x-3k)^k for 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula