|
%I #11 Mar 02 2022 08:57:25
%S -1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,5,1,5,-1,-1,11,1,1,11,-1,-1,19,41,71,
%T 41,19,-1,-1,29,71,29,29,71,29,-1,-1,41,239,701,869,701,239,41,-1,-1,
%U 55,379,811,181,181,811,379,55,-1
%N Triangle, T(n, k), read by rows: T(n, k) = t(n, k)^2 - t(n, k) - 1, where t(n,k) = (m*(n-k) + 1)*t(n-1, k-1) + (m*k - (m-1))*t(n-1, k) and m = -1.
%H G. C. Greubel, <a href="/A144432/b144432.txt">Rows n = 1..50 of the triangle, flattened</a>
%F T(n, k) = t(n, k)^2 - t(n, k) - 1, where t(n,k) = (m*(n-k) + 1)*t(n-1, k-1) + (m*k - (m-1))*t(n-1, k) and m = -1.
%F From _G. C. Greubel_, Mar 02 2022: (Start)
%F T(n, n-k) = T(n, k).
%F T(n, k) = t(n,k)^2 - t(n,k) - 1, where t(n,k) = (-1)^(k-1)*binomial(n-3, k-1) + (-1)^(n+k)*binomial(n-3, k-3) with t(1, k) = t(2, k) = 1.
%F Sum_{k=1..n} T(n,k) = -n*[n<4] + ( 2*binomial(2*n-6, n-3)*(binomial(n-1,2) - (-1)^n*binomial(n-3,2))/binomial(n-1,2) - n )*[n>=4]. (End)
%e Triangle begins as:
%e -1;
%e -1, -1;
%e -1, -1, -1;
%e -1, 1, 1, -1;
%e -1, 5, 1, 5, -1;
%e -1, 11, 1, 1, 11, -1;
%e -1, 19, 41, 71, 41, 19, -1;
%e -1, 29, 71, 29, 29, 71, 29, -1;
%e -1, 41, 239, 701, 869, 701, 239, 41, -1;
%e -1, 55, 379, 811, 181, 181, 811, 379, 55, -1;
%t t[n_, k_, m_]:= t[n, k, m]= If[k==1 || k==n, 1, (m*(n-k)+1)*t[n-1,k-1,m] + (m*(k - 1)+1)*t[n-1,k,m]];
%t T[n_, k_, m_]:= t[n,k,m]^2 -t[n,k,m] -1;
%t Table[T[n,k,-1], {n,15}, {k,n}]//Flatten (* modified by _G. C. Greubel_, Mar 02 2022 *)
%o (Sage)
%o def t(n,k):
%o if (n<3): return 1
%o else: return (-1)^(k-1)*binomial(n-3, k-1) + (-1)^(n+k)*binomial(n-3, k-3)
%o def A144432(n,k): return t(n,k)^2 - t(n,k) - 1
%o flatten([[A144432(n,k) for k in (1..n)] for n in (1..15)]) # _G. C. Greubel_, Mar 02 2022
%Y Cf. A098593, A144431.
%K sign,tabl
%O 1,12
%A _Roger L. Bagula_, Oct 04 2008
%E Edited by _G. C. Greubel_, Mar 02 2022
|
