cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A144444 Triangle read by rows: T(n, k) = (1-n+k)*T(n-1, k-1) + (2-k)*T(n-1, k) - T(n-2, k-1) with T(n, 1) = T(n, n) = 1.

This page as a plain text file.
%I A144444 #9 Mar 05 2022 01:39:37
%S A144444 1,1,1,1,-1,1,1,-2,-2,1,1,-3,5,-3,1,1,-4,3,3,-4,1,1,-5,12,-17,12,-5,1,
%T A144444 1,-6,12,-5,-5,12,-6,1,1,-7,23,-50,47,-50,23,-7,1,1,-8,25,-27,64,64,
%U A144444 -27,25,-8,1
%N A144444 Triangle read by rows: T(n, k) = (1-n+k)*T(n-1, k-1) + (2-k)*T(n-1, k) - T(n-2, k-1) with T(n, 1) = T(n, n) = 1.
%H A144444 G. C. Greubel, <a href="/A144444/b144444.txt">Rows n = 1..50 of the triangle, flattened</a>
%F A144444 T(n, k) = (1-n+k)*T(n-1, k-1) + (2-k)*T(n-1, k) - T(n-2, k-1) with T(n, 1) = T(n, n) = 1.
%F A144444 Sum_{k=1..n} T(n, k) = s(n), where s(n) = -(n-4)*s(n-1) - s(n-2), s(1) = 1, s(2) = 2.
%F A144444 From _G. C. Greubel_, Mar 04 2022: (Start)
%F A144444 Sum_{k=1..n} T(n, k) = 2*[n<3] + (-1)^(n-1)*A075374(n-2).
%F A144444 T(n, n-k) = T(n, k).
%F A144444 T(n, 2) = [n=2] - n + 2.
%F A144444 T(n, 3) = (1/2)*((n^2 -5*n +5) -5*(-1)^n) - [n=3]. (End)
%e A144444 Triangle begins as:
%e A144444   1;
%e A144444   1,  1;
%e A144444   1, -1,  1;
%e A144444   1, -2, -2,   1;
%e A144444   1, -3,  5,  -3,  1;
%e A144444   1, -4,  3,   3, -4,   1;
%e A144444   1, -5, 12, -17, 12,  -5,   1;
%e A144444   1, -6, 12,  -5, -5,  12,  -6,  1;
%e A144444   1, -7, 23, -50, 47, -50,  23, -7,  1;
%e A144444   1, -8, 25, -27, 64,  64, -27, 25, -8, 1;
%t A144444 T[n_, k_, m_, j_]:= T[n,k,m,j]= If[k==1 || k==n, 1, (m*(n-k)+1)*T[n-1,k-1,m,j] + (m*(k-1)+1)*T[n-1,k,m,j] + j*T[n-2,k-1,m,j]];
%t A144444 Table[T[n,k,-1,-1], {n,15}, {k,n}]//Flatten (* modified by _G. C. Greubel_, Mar 04 2022 *)
%o A144444 (Sage)
%o A144444 def T(n,k,m,j):
%o A144444     if (k==1 or k==n): return 1
%o A144444     else: return (m*(n-k)+1)*T(n-1,k-1,m,j) + (m*(k-1)+1)*T(n-1,k,m,j) + j*T(n-2,k-1,m,j)
%o A144444 def A144444(n,k): return T(n,k,-1,-1)
%o A144444 flatten([[A144444(n,k) for k in (1..n)] for n in (1..15)]) # _G. C. Greubel_, Mar 04 2022
%Y A144444 Cf. A144431, A144432, A144435, A144436, A144438, A144439, A144440, A144441, A144442, A144443, A144445.
%Y A144444 Cf. A075374.
%K A144444 sign,tabl
%O A144444 1,8
%A A144444 _Roger L. Bagula_ and _Gary W. Adamson_, Oct 05 2008