|
%I #21 Mar 25 2020 17:46:14
%S 1,-2,1,-2,-2,1,-2,-2,-2,1,-2,-2,-2,-2,1,-2,-2,-2,-2,-2,1,-2,-2,-2,-2,
%T -2,-2,1,-2,-2,-2,-2,-2,-2,-2,1,-2,-2,-2,-2,-2,-2,-2,-2,1,-2,-2,-2,-2,
%U -2,-2,-2,-2,-2,1,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,1
%N Riordan array ((1-3*x)/(1-x), x).
%C Inverse of A114283. Row sums are 1-2n. Diagonal sums are A114285. Sequence array of 3*0^n-2.
%H Michael De Vlieger, <a href="/A114284/b114284.txt">Table of n, a(n) for n = 0..1000</a>
%H Ângela Mestre, José Agapito, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL22/Mestre/mestre2.html">Square Matrices Generated by Sequences of Riordan Arrays</a>, J. Int. Seq., Vol. 22 (2019), Article 19.8.4.
%F T(n, k) = if(k<=n, 3*0^(n-k)-2, 0).
%F a(n) = -3 floor(1/2 sqrt(8 x+1)-1/2)+3 floor(1/2 sqrt(8 x+9)-1/2)-2 (* Jackson Xier, Oct 07 2011 *)
%e Triangle begins
%e 1;
%e -2,1;
%e -2,-2,1;
%e -2,-2,-2,1;
%e -2,-2,-2,-2,1;
%t Table[-2 - 3 Floor[1/2 (-1 + Sqrt[1 + 8 x])] + 3 Floor[1/2 (-1 + Sqrt[9 + 8 x])], {x, 0, 250}] (* Jackson Xier, Oct 07 2011 *)
%K easy,sign,tabl
%O 0,2
%A _Paul Barry_, Nov 20 2005
|
