A141413 -id:A141413 - cp's OEIS frontend

A122803 Powers of -2: a(n) = (-2)^n.

1, -2, 4, -8, 16, -32, 64, -128, 256, -512, 1024, -2048, 4096, -8192, 16384, -32768, 65536, -131072, 262144, -524288, 1048576, -2097152, 4194304, -8388608, 16777216, -33554432, 67108864, -134217728, 268435456, -536870912, 1073741824, -2147483648, 4294967296, -8589934592, 17179869184

Offset: 0

Franklin T. Adams-Watters, Sep 11 2006

The number -2 can be used as a base of numeration (see the Weisstein link). - Alonso del Arte, Mar 30 2014
Contribution from M. F. Hasler, Oct 21 2014: (Start)
This is the inverse binomial transform of A033999 = n->(-1)^n, and the binomial transform of A033999*A000244 = n->(-3)^n, see also A141413.
Prefixed with one 0, i.e., (0,1,-2,4,...) = -A033999*A131577, it is the binomial transform of (0, 1, -4, 13, -40, 121,...) = -A033999*A003462, and inverse binomial transform of (0,1,0,1,0,1,...) = A000035.
Prefixed with two 0's, i.e., (0,0,1,-2,4,-8,...), it is the binomial transform of (0,0,1,-5,18,-58,179,-543,...) (cf. A000340) and inverse binomial transform of (0,0,1,1,2,2,3,3,...) = A004526. (End)
Prefixed with three 0's, this is the inverse binomial difference of (0, 0, 0, 1, 2, 4, 6, 9, 12, 16,...) = concat(0, A002620), which has as successive differences (0, 0, 1, 1, 2, 2,...) = A004526, then (0, 1, 0, 1,...) = A000035, then (1, -1, 1, -1,...) = A033999, and then (-2)^k*A033999 with k=1,2,3,... - Paul Curtz, Oct 16 2014, edited by M. F. Hasler, Oct 21 2014
Stirling-Bernoulli transform of triangular numbers: 1, 3, 6, 10, 15, 21, 28, ... - Philippe Deléham, May 25 2015

Franklin T. Adams-Watters, Table of n, (-2)^n for n = 0..1000
Tanya Khovanova, Recursive Sequences
Eric Weisstein's World of Mathematics, Negabinary.
Index entries for linear recurrences with constant coefficients, signature (-2).

Cf. A000079 (powers of 2), A004526, A005351, A005352, A011782, A034008, A131577, A171449, A248800.

[(-2)^n: n in [0..60]]; // Vincenzo Librandi, Oct 22 2014

A122803:=n->(-2)^n; seq(A122803(n), n=0..50); # Wesley Ivan Hurt, Mar 30 2014

Table[(-2)^n, {n, 0, 50}] (* Vladimir Joseph Stephan Orlovsky, Feb 15 2011 *)

a(n)=(-2)^n \\ Charles R Greathouse IV, Sep 24 2015

def A122803(n): return -(1<Chai Wah Wu, Nov 18 2022

a(n) = (-2)^n = (-1)^n * 2^n.
a(n) = -2*a(n-1), n > 0; a(0) = 1. G.f.: 1/(1+2x). - Philippe Deléham, Nov 19 2008
Sum_{n >= 0} 1/a(n) = 2/3. - Jaume Oliver Lafont, Mar 01 2009
E.g.f.: 1/exp(2*x). - Arkadiusz Wesolowski, Aug 13 2012
a(n) = Sum_{k = 0..n} (-2)^(n-k)*binomial(n, k)*A030195(n+1). - R. J. Mathar, Oct 15 2012
G.f.: 1/(1+2x). A122803 = A033999 * A000079. - M. F. Hasler, Oct 21 2014
a(n) = Sum_{k = 0..n} A163626(n,k)*A000217(k+1). - Philippe Deléham, May 25 2015

A285067 Row sums of triangle A285066.

Original entry on oeis.org

1, 5, 57, 989, 22833, 658805, 22810857, 921455309, 42540129633, 2209407621605, 127500056700057, 8093522778736829, 560471288461196433, 42046635718027122005, 3396986478841654717257, 294048932819502579461549, 27150267978072875530135233, 2663529874012507049631576005

Offset: 0

Wolfdieter Lang, Apr 19 2017

See A285066 for details.

Cf. A285066, A141413(n+2) (alternating row sums).

a(n) = Sum_{m=0..n} A285066(n, m),  n >= 0.
E.g.f.: exp(x)/(2 - exp(4*x)).
a(n) ~ n! * 2^(2*n - 3/4) / log(2)^(n+1). - Vaclav Kotesovec, Apr 19 2017
a(n) = 1 + Sum_{k=1..n} binomial(n,k) * 4^k * a(n-k). - Ilya Gutkovskiy, Jun 21 2022

A193726 Triangular array: the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^n.

Original entry on oeis.org

1, 1, 2, 2, 9, 10, 4, 28, 65, 50, 8, 76, 270, 425, 250, 16, 192, 920, 2200, 2625, 1250, 32, 464, 2800, 9000, 16250, 15625, 6250, 64, 1088, 7920, 32000, 77500, 112500, 90625, 31250, 128, 2496, 21280, 103600, 315000, 612500, 743750, 515625, 156250

Offset: 0

Clark Kimberling, Aug 04 2011

See A193722 for the definition of fusion of two sequences of polynomials or triangular arrays.

Triangle T(n,k), read by rows, given by (1,1,0,0,0,0,0,0,0,...) DELTA (2,3,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938. - Philippe Deléham, Oct 05 2011

			First six rows:
   1;
   1,   2;
   2,   9,  10;
   4,  28,  65,   50;
   8,  76, 270,  425,  250;
  16, 192, 920, 2200, 2625, 1250;

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

Cf. A002532, A011782, A020699, A045873, A081040, A084938.

Cf. A133494, A141413, A169634, A193722, A193727.

function T(n, k) // T = A193726
  if k lt 0 or k gt n then return 0;
  elif n lt 2 then return k+1;
  else return 2*T(n-1, k) + 5*T(n-1, k-1);
  end if;
end function;
[T(n, k): k in [0..n], n in [0..12]]; // G. C. Greubel, Dec 02 2023

(* First program *)
z = 8; a = 1; b = 2; c = 1; d = 2;
p[n_, x_] := (a*x + b)^n ; q[n_, x_] := (c*x + d)^n
t[n_, k_] := Coefficient[p[n, x], x^k]; t[n_, 0] := p[n, x] /. x -> 0;
w[n_, x_] := Sum[t[n, k]*q[n + 1 - k, x], {k, 0, n}]; w[-1, x_] := 1
g[n_] := CoefficientList[w[n, x], {x}]
TableForm[Table[Reverse[g[n]], {n, -1, z}]]
Flatten[Table[Reverse[g[n]], {n, -1, z}]]  (* A193726 *)
TableForm[Table[g[n], {n, -1, z}]]
Flatten[Table[g[n], {n, -1, z}]]  (* A193727 *)
(* Second program *)
T[n_, k_]:= T[n, k]= If[k<0 || k>n, 0, If[n<2, k+1, 2*T[n-1, k] + 5*T[n -1, k-1]]];
Table[T[n, k], {n,0,12}, {k,0,n}]//Flatten (* G. C. Greubel, Dec 02 2023 *)

def T(n, k): # T = A193726
    if (k<0 or k>n): return 0
    elif (n<2): return k+1
    else: return 2*T(n-1, k) + 5*T(n-1, k-1)
flatten([[T(n, k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Dec 02 2023

T(n,k) = 5*T(n-1,k-1) + 2*T(n-1,k) with T(0,0)=T(1,0)=1 and T(1,1)=2. - Philippe Deléham, Oct 05 2011
G.f.: (1-x-3*x*y)/(1-2*x-5*x*y). - R. J. Mathar, Aug 11 2015
From G. C. Greubel, Dec 02 2023: (Start)
T(n, 0) = A011782(n).
T(n, n) = A020699(n).
T(n, n-1) = A081040(n-1).
Sum_{k=0..n} T(n, k) = A169634(n-1) + (4/7)*[n=0].
Sum_{k=0..n} (-1)^k * T(n, k) = (-1)^n*A133494(n) = -A141413(n+1).
Sum_{k=0..floor(n/2)} T(n-k, k) = A002532(n) + 2*A002532(n-1) + (3/5)*[n=0].
Sum_{k=0..floor(n/2)} (-1)^k * T(n-k, k) = A045873(n) - 2*A045873(n-1) + (3/5)*[n=0]. (End)

A285066 Triangle read by rows: T(n, m) = A285061(n, m)*m!, 0 <= m <= n.

Original entry on oeis.org

1, 1, 4, 1, 24, 32, 1, 124, 480, 384, 1, 624, 5312, 10752, 6144, 1, 3124, 52800, 203520, 276480, 122880, 1, 15624, 500192, 3279360, 7956480, 8110080, 2949120, 1, 78124, 4626720, 48633984, 187729920, 329441280, 268369920, 82575360, 1, 390624, 42265472, 687762432, 3969552384, 10672865280, 14615838720, 9909043200, 2642411520, 1, 1953124, 383514240, 9448097280, 78486589440, 303521218560, 621544734720, 696605736960, 404288962560, 95126814720

Offset: 0

Wolfdieter Lang, Apr 19 2017

This is the Sheffer triangle S2[4,1] = A285061 with column m scaled by m!. This is the fourth member of the triangle family A131689, A145901 and A284861.
This triangle appears in the o.g.f. G(n, x) = Sum_{m=0..n} T(n, m)*x^m/(1-x)^(m+1), n >= 0, of the power sequence {(1+4*m)^n}_{m >= 0}.
The diagonal sequence is A047053. The row sums give A285067. The alternating sum of row n is A141413(n+2), n >= 0.
The first column sequences are: A000012, 4*A003463, 2!*4^2*A016234.

			The triangle T(n, m) begins:
  n\m 0     1       2        3         4         5         6        7
  0:  1
  1:  1     4
  2:  1    24      32
  3:  1   124     480      384
  4:  1   624    5312    10752      6144
  5:  1  3124   52800   203520    276480    122880
  6:  1 15624  500192  3279360   7956480   8110080   2949120
  7:  1 78124 4626720 48633984 187729920 329441280 268369920 82575360
  ...
row 8: 1 390624 42265472 687762432 3969552384 10672865280 14615838720 9909043200 2642411520
row 9: 1 1953124 383514240 9448097280 78486589440 303521218560 621544734720 696605736960 404288962560 95126814720
...

Wolfdieter Lang, On Sums of Powers of Arithmetic Progressions, and Generalized Stirling, Eulerian and Bernoulli numbers, arXiv:1707.04451 [math.NT], 2017.

Cf. A000012, 4*A003463, 32*A016234, A111578 (T(n, m)/4^m), A131689, A141413, A145901, A225118, A225472, A225473, A284861, A285061.

T[n_, m_]:=Sum[Binomial[m, k]*(-1)^(k - m)*(1 + 4k)^n, {k, 0, n}]; Table[T[n, m], {n, 0, 10},{m, 0, n}] // Flatten (* Indranil Ghosh, May 02 2017 *)

from sympy import binomial
def T(n, m):
    return sum([binomial(m, k)*(-1)**(k - m)*(1 + 4*k)**n for k in range(n + 1)])
for n in range(21):
    print([T(n, m) for m in range(n + 1)])
# Indranil Ghosh, May 02 2017

T(n, m) = A285061(n, m)*m! = A111578(n, m)*(4^m*m!), 0 <= m <= n.
T(n, m) = Sum_{k=0..n} binomial(m,k)*(-1)^(k-m)*(1+4*k)^n.
T(n, m) = Sum_{j=0..n} binomial(n-j,m-j)*A225118(n,n-j).
Recurrence: T(n, -1) = 0, T(0, 0) = 1, T(n, m) = 0 if n < m and T(n, m) =
4*m*T(n-1, m-1) + (1+4*m)*T(n-1, m) for n >= 1, m=0..n.
E.g.f. row polynomials R(n, x) = Sum_{m=0..n} T(n, m)*x^m: exp(z)/(1 - x*(exp(4*z) - 1)).
E.g.f. column m: exp(x)*(exp(4*x) - 1)^m, m >= 0.
O.g.f. column m: m!*(4*x)^m/Product_{j=0..m} (1 - (1 + 4*j)*x), m >= 0.

A183190 Triangle T(n,k), read by rows, given by (1, 1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.

Original entry on oeis.org

1, 1, 0, 2, 1, 0, 4, 4, 1, 0, 8, 12, 6, 1, 0, 16, 32, 24, 8, 1, 0, 32, 80, 80, 40, 10, 1, 0, 64, 192, 240, 160, 60, 12, 1, 0, 128, 448, 672, 560, 280, 84, 14, 1, 0, 256, 1024, 1792, 1792, 1120, 448, 112, 16, 1, 0, 512, 2304, 4608, 5376, 4032, 2016, 672, 144, 18, 1, 0

Offset: 0

Philippe Deléham, Dec 14 2011

A071919*A007318 as infinite lower triangular matrices.
A129186*A038207 as infinite lower triangular matrices.
From Paul Curtz, Nov 12 2019: (Start)
If a new main diagonal of 0's is added to the triangle, then for this variant the following propositions hold:
   The first column is A166444.
   The second column is A139756.
   The antidiagonal sums are A000129 (Pell numbers).
   The row sums are (-1)^n*A141413.
   The signed row sums are 0 followed by 1's, autosequence companion to A054977.
(End)

			Triangle begins:
   1;
   1,  0;
   2,  1,  0;
   4,  4,  1,  0;
   8, 12,  6,  1,  0;
  16, 32, 24,  8,  1, 0;
  32, 80, 80, 40, 10, 1, 0;
  ...

Essentially the same as A038207, A062715, A065109.
Cf. A001787, A001788, A139756, A000129 (antidiagonals sums).
Cf. A141413, A166444, A054977.

T:= proc(n, k) option remember; `if`(k<0 or k>n, 0,
      `if`(n<2, 1-k, 2*T(n-1, k) +T(n-1, k-1)))
    end:
seq(seq(T(n,k), k=0..n), n=0..12);  # Alois P. Heinz, Nov 08 2019

T[n_, k_] /; 0 <= k <= n := T[n, k] = 2 T[n-1, k] + T[n-1, k-1];
T[0, 0] = T[1, 0] = 1; T[1, 1] = 0; T[, ] = 0;
Table[T[n, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Jean-François Alcover, Nov 08 2019 *)

T(n,k) = 2*T(n-1,k) + T(n-1,k-1) with T(0,0)=T(1,0)=1 and T(1,1)=0 .
G.f.: (1-(1+y)*x)/(1-(2+y)*x).
Sum_{k, 0<=k<=n} T(n,k)*x^k = A019590(n+1), A000012(n), A011782(n), A133494(n) for x = -2, -1, 0, 1 respectively.
Sum_{k, 0<=k<=n} T(n,k)*x^(n-k) = A000007(n), A133494(n), A020699(n) for x = 0, 1, 2 respectively.
T(2n,n) = A069720(n).

A328284 An extension of the Jacobsthal numbers: 0, 0, 1, followed by A001045.

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 3, 5, 11, 21, 43, 85, 171, 341, 683, 1365, 2731, 5461, 10923, 21845, 43691, 87381, 174763, 349525, 699051, 1398101, 2796203, 5592405, 11184811, 22369621, 44739243, 89478485

Offset: 0

Paul Curtz, Oct 11 2019

nonn

OEIS Wiki, Autosequence
Index entries for linear recurrences with constant coefficients, signature (1,2).

Cf. A000129, A001045, A054977, A139756, A141413, A166444, A183190.

Cf. A000079, A005578, A063524, A086445, A139818, A257113.

a[n_] := If[n>3, (2^(n-3) + (-1)^n)/3, If[n == 2, 1, 0]]; (* Jean-François Alcover, Oct 16 2019 *)

a(n) is the fourth row of the following array:
  0,  0,  0,  0, 0, 1, 3, 7, 14, 27, 51, 97, ...
  0,  0,  0,  0, 1, 2, 4, 7, 13, 24, 46, 89, ... = A086445
  0,  0,  0,  1, 1, 2, 3, 6, 11, 22, 43, 86, ... = 0, 0, 0, A005578(n)
  0,  0,  1,  0, 1, 1, 3, 5, 11, 21, 43, 85, ... = a(n)
  0,  1, -1,  1, 0, 2, 2, 6, 10, 22, 42, 86, ...
  1, -2,  2, -1, 2, 0, 4, 4, 12, 20, 44, 84, ...
From the main diagonal onward, every row is an autosequence of the first kind.
From Stefano Spezia, Oct 16 2019: (Start)
O.g.f.: x^2*(-1 + x + x^2)/(-1 + x + 2*x^2).
E.g.f.: (1/24)*exp(-x)*(8 - 9*exp(x) + exp(3*x) + 6*exp(x)*x + 6*exp(x)*x^2).
a(n) = a(n-1) + 2*a(n-2) for n > 4. (End)
a(n) = Sum_{k=0..n-1} A183190(n-k-2, n-2*k-2). - Jean-François Alcover, Nov 10 2019

Partially edited by Peter Luschny, Nov 12 2019

A352779 Powers of -3: a(n) = (-3)^n.

Original entry on oeis.org

1, -3, 9, -27, 81, -243, 729, -2187, 6561, -19683, 59049, -177147, 531441, -1594323, 4782969, -14348907, 43046721, -129140163, 387420489, -1162261467, 3486784401, -10460353203, 31381059609, -94143178827, 282429536481, -847288609443, 2541865828329, -7625597484987

Offset: 0

L. Edson Jeffery, Apr 04 2022

Winston de Greef, Table of n, a(n) for n = 0..2082
Index entries for linear recurrences with constant coefficients, signature (-3).

Cf. A000244, A033999, A141413.

LinearRecurrence[{-3}, {1}, 28]
CoefficientList[Series[1/(1+3*x), {x,0,27}], x]
Table[(-3)^n, {n,0,27}]

a(n)=(-3)^n \\ Winston de Greef, Mar 19 2023

a(0) = 1; a(n) = -3*a(n-1), n >= 1.
G.f.: 1/(1+3*x).
a(n) = (-1)^n*A000244(n).
E.g.f.: 1/exp(3*x). - Elmo R. Oliveira, Dec 17 2023

A362353 Triangle read by rows: T(n,k) = (-1)^(n-k)binomial(n, k)(k+3)^n, for n >= 0, and k = 0,1, ..., n. Coefficients of certain Sidi polynomials.

Original entry on oeis.org

1, -3, 4, 9, -32, 25, -27, 192, -375, 216, 81, -1024, 3750, -5184, 2401, -243, 5120, -31250, 77760, -84035, 32768, 729, -24576, 234375, -933120, 1764735, -1572864, 531441, -2187, 114688, -1640625, 9797760, -28824005, 44040192, -33480783, 10000000, 6561, -524288, 10937500, -94058496, 403536070, -939524096, 1205308188, -800000000, 214358881

Offset: 0

Harlan J. Brothers and Wolfdieter Lang, Apr 27 2023

This is the member N = 2 of a family of signed triangles with row sums n! = A000142(n): T(N; n, k) = (-1)^(n-k)*binomial(n, k)*(k + N + 1)^n, for integer N, n >= 0 and k = 0, 1, ..., n. The row polynomials PS(N; n, z) = Sum_{k=0..n} T(N; n, k)*z^k = ((-1)^n/z^N)*D_{n,N+1,n}(z) in [Sidi 1980].
For N = -1, 0 and 1 see A258773(n, k), A075513(n+1, k) and (-1)^(n-k) * A154715(n, k), respectively.
The column sequences, for k = 0, 1, ..., 6 and n >= k, are A141413(n+2), (-1)^(n+1)*A018215(n) = 4*(-1)^(n+1)*A002697(n), 5^2*(-1)^n*A081135(n), (-1)^(n+1)*A128964(n-1) = 6^3*(-1)^(n+1)*A081144(n), 7^4*(-1)^n*A139641(n-4), 2^15*(-1)^(n+1)*A173155(n-5), 3^12*(-1)^n*A173191(n-6), respectively.
The e.g.f. of the triangle (see below) needs the exponential convolution (LambertW(-z)/(-z))^2 = Sum_{n>=0} c(2; n)*z^n/n!, where c(2; n) = Sum_{m=0..n} |A137352(n+1, m)|*2^m = A007334(n+2).
The row sums give n! = A000142(n).

			The triangle T begins:
n\k    0       1        2         3         4          5          6         7
0:     1
1:    -3       4
2:     9     -32       25
3:   -27     192     -375       216
4:    81   -1024     3750     -5184      2401
5:  -243    5120   -31250     77760    -84035      32768
6:   729  -24576   234375   -933120   1764735   -1572864     531441
7: -2187  114688 -1640625   9797760 -28824005   44040192  -33480783  10000000
...
n = 8:  6561 -524288 10937500 -94058496 403536070 -939524096 1205308188 -800000000 2143588,
n = 9: -19683 2359296 -70312500 846526464 -5084554482 16911433728 -32543321076 36000000000 -21221529219 5159780352.

Paolo Xausa, Table of n, a(n) for n = 0..5049 (rows 0..100 of the triangle, flattened)
Wolfdieter Lang, On a Certain Family of Sidi Polynomials, May 2023.
Avram Sidi, Numerical Quadrature and Nonlinear Sequence Transformations; Unified Rules for Efficient Computation of Integrals with Algebraic and Logarithmic Endpoint Singularities, Math. Comp., 35 (1980), 851-874.

Cf. A000142 (row sums), A075513, A154715, A258773.

Columns k = 0..6 involve (see above): A002697, A007334, A018215, A081135, A081144, A128964, A137352, A139641, A141413, A173155, A173191.

A362353row[n_]:=Table[(-1)^(n-k)Binomial[n,k](k+3)^n,{k,0,n}];Array[A362353row,10,0] (* Paolo Xausa, Jul 30 2023 *)

T(n, k) = (-1)^(n-k)*binomial(n, k)*(k + 3)^n, for n >= 0, k = 0, 1, ..., n.
O.g.f. of column k: (x*(k + 3))^k/(1 - (k + 3)*x)^(k+1), for k >= 0.
E.g.f. of column k: exp(-(k + 3)*x)*((k + 3)*x)^k/k!, for k >= 0.
E.g.f. of the triangle, that is, the e.g.f. of its row polynomials {PS(2;n,y)}_{n>=0}): ES(2;y,x) = exp(-3*x)*(1/3)*(d/dz)(W(-z)/(-z))^2, after replacing z by x*y*exp(-x), where W is the Lambert W-function for the principal branch. This becomes ES(2;y,x) = exp(-3*x)*exp(3*(-W(-z)))/(1 - (-W(-z)), with z = x*y*exp(-x).

a(41)-a(44) from Paolo Xausa, Jul 31 2023

cp's OEIS Frontend

A122803 Powers of -2: a(n) = (-2)^n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Python

Formula

A285067 Row sums of triangle A285066.

Views

Author

Keywords

Comments

Crossrefs

Formula

A193726 Triangular array: the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)^n and q(n,x)=(x+2)^n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A285066 Triangle read by rows: T(n, m) = A285061(n, m)*m!, 0 <= m <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

A183190 Triangle T(n,k), read by rows, given by (1, 1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A328284 An extension of the Jacobsthal numbers: 0, 0, 1, followed by A001045.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A352779 Powers of -3: a(n) = (-3)^n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A362353 Triangle read by rows: T(n,k) = (-1)^(n-k)*binomial(n, k)*(k+3)^n, for n >= 0, and k = 0,1, ..., n. Coefficients of certain Sidi polynomials.

Views

A362353 Triangle read by rows: T(n,k) = (-1)^(n-k)binomial(n, k)(k+3)^n, for n >= 0, and k = 0,1, ..., n. Coefficients of certain Sidi polynomials.