cp's OEIS Frontend

A306547 Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)*T(n-1, k) + (n-k-2) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).

%I A306547 #15 Apr 19 2019 11:02:57
%S A306547 1,1,-2,1,-11,4,1,-55,35,-8,1,-274,210,-91,16,1,-1368,986,-637,219,
%T A306547 -32,1,-6837,3180,-3473,1752,-507,64,1,-34181,-1431,-17951,10543,
%U A306547 -4563,1147,-128,1,-170900,-145310,-129950,48442,-30524,11470,-2555,256,1,-854494,-1726360,-1490890,-2314,-177832,84176,-28105,5627,-512
%N A306547 Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)*T(n-1, k) + (n-k-2) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).
%C A306547 Row sums are {1, -1, -6, -27, -138, -831, -5820, -46563, -419070, -4190703, ...}.
%C A306547 The Mathematica code for e(n,k,m) gives eleven sequences of which the first few are in the OEIS (see Crossrefs section).
%D A306547 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, pp. 214-215.
%H A306547 G. C. Greubel, <a href="/A306547/b306547.txt">Rows n = 1..100 of triangle, flattened</a>
%F A306547 T(n, k) = (k+3)*T(n-1, k) + (n-k-2)*T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).
%F A306547 e(n,k,m)= (k+m)*e(n-1, k, m) + (n-k+1-m)*e(n-1, k-1, m) with m=3.
%e A306547 Triangle begins with:
%e A306547 1.
%e A306547 1,      -2.
%e A306547 1,     -11,       4.
%e A306547 1,     -55,      35,      -8.
%e A306547 1,    -274,     210,     -91,    16.
%e A306547 1,   -1368,     986,    -637,   219,    -32.
%e A306547 1,   -6837,    3180,   -3473,  1752,   -507,    64.
%e A306547 1,  -34181,   -1431,  -17951, 10543,  -4563,  1147,  -128.
%e A306547 1, -170900, -145310, -129950, 48442, -30524, 11470, -2555, 256.
%t A306547 e[n_, 0, m_]:= 1; (* Example for m=3 *)
%t A306547 e[n_, k_, m_]:= 0 /; k >= n;
%t A306547 e[n_, k_, m_]:= (k+m)*e[n-1, k, m] + (n-k+1-m)*e[n-1, k-1, m];
%t A306547 Table[Flatten[Table[Table[e[n, k, m], {k,0,n-1}], {n,1,10}]], {m,0,10}]
%t A306547 T[n_, 1]:= 1; T[n_, n_]:= (-2)^(n-1); T[n_, k_]:= T[n, k] = (k+3)*T[n-1, k] + (n-k-2)*T[n-1, k-1]; Table[T[n, k], {n, 1, 12}, {k, 1, n}]//Flatten
%o A306547 (PARI) {T(n, k) = if(k==1, 1, if(k==n, (-2)^(n-1), (k+3)*T(n-1, k) + (n-k-2)* T(n-1, k-1)))};
%o A306547 for(n=1, 12, for(k=1, n, print1(T(n, k), ", ")))
%o A306547 (Sage)
%o A306547 def T(n, k):
%o A306547     if (k==1): return 1
%o A306547     elif (k==n): return (-2)^(n-1)
%o A306547     else: return (k+3)*T(n-1, k) + (n-k-2)* T(n-1, k-1)
%o A306547 [[T(n, k) for k in (1..n)] for n in (1..12)]
%Y A306547 Cf. A157011 (m=0), A008292 (m=1), A157012 (m=2), A157013 (m=3), this sequence.
%K A306547 sign,tabl
%O A306547 1,3
%A A306547 _G. C. Greubel_, Feb 22 2019