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.

A144435 Triangle T(n, k) = (m*(n-k) + 1)*T(n-1, k-1) + (m*(k-1) + 1)*T(n-1, k) + j*T(n-2, k-1), where T(n, 1) = T(n, n) = 1, m = -1, and j = 2, read by rows.

This page as a plain text file.
%I A144435 #9 Mar 03 2022 03:48:15
%S A144435 1,1,1,1,2,1,1,1,1,1,1,0,2,0,1,1,-1,0,0,-1,1,1,-2,3,4,3,-2,1,1,-3,3,
%T A144435 -17,-17,3,-3,1,1,-4,8,28,110,28,8,-4,1,1,-5,10,-90,-476,-476,-90,10,
%U A144435 -5,1
%N A144435 Triangle T(n, k) = (m*(n-k) + 1)*T(n-1, k-1) + (m*(k-1) + 1)*T(n-1, k) + j*T(n-2, k-1), where T(n, 1) = T(n, n) = 1, m = -1, and j = 2, read by rows.
%H A144435 G. C. Greubel, <a href="/A144435/b144435.txt">Rows n = 1..50 of the triangle, flattened</a>
%F A144435 T(n, k) = (m*(n-k) + 1)*T(n-1, k-1) + (m*(k-1) + 1)*T(n-1, k) + j*T(n-2, k-1), where T(n, 1) = T(n, n) = 1, m = -1, and j = 2.
%F A144435 From _G. C. Greubel_, Mar 03 2022: (Start)
%F A144435 T(n, n-k) = T(n, k).
%F A144435 T(n, 2) = 5 - n, n >= 3.
%F A144435 T(n, 3) = (1/2)*(n^2 - 11*n + 32) - (-1)^n, n >= 4.
%F A144435 T(n, 4) = (1/12)*(-2*n^3 + 36*n^2 - 226*n + 496 - (-1)^n*(2^n - 12*(n-1))), n >= 5. (End)
%e A144435 Triangle begins as:
%e A144435   1;
%e A144435   1,  1;
%e A144435   1,  2,  1;
%e A144435   1,  1,  1,   1;
%e A144435   1,  0,  2,   0,    1;
%e A144435   1, -1,  0,   0,   -1,    1;
%e A144435   1, -2,  3,   4,    3,   -2,   1;
%e A144435   1, -3,  3, -17,  -17,    3,  -3,  1;
%e A144435   1, -4,  8,  28,  110,   28,   8, -4,  1;
%e A144435   1, -5, 10, -90, -476, -476, -90, 10, -5, 1;
%t A144435 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 A144435 Table[T[n,k,-1,2], {n,15}, {k,n}]//Flatten (* modified by _G. C. Greubel_, Mar 03 2022 *)
%o A144435 (Sage)
%o A144435 def T(n,k,m,j):
%o A144435     if (k==1 or k==n): return 1
%o A144435     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 A144435 def A144435(n,k): return T(n,k,-1,2)
%o A144435 flatten([[A144435(n,k) for k in (1..n)] for n in (1..15)]) # _G. C. Greubel_, Mar 03 2022
%Y A144435 Cf. A144431, A144432, A144436.
%K A144435 sign,tabl
%O A144435 1,5
%A A144435 _Roger L. Bagula_ and _Gary W. Adamson_, Oct 04 2008
%E A144435 Edited by _G. C. Greubel_, Mar 03 2022