login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080246 Signed version of A035607. 5

%I #15 Mar 11 2015 14:44:48

%S 1,-2,1,2,-4,1,-2,8,-6,1,2,-12,18,-8,1,-2,16,-38,32,-10,1,2,-20,66,

%T -88,50,-12,1,-2,24,-102,192,-170,72,-14,1,2,-28,146,-360,450,-292,98,

%U -16,1,-2,32,-198,608,-1002,912,-462,128,-18,1,2,-36,258,-952,1970,-2364

%N Signed version of A035607.

%C Written as lower triangular matrix this has inverse A080247. Row sums are (1,-1,-1,1,1,-1,-1,1,1,...) Diagonal sums are signed tribonacci numbers A078042

%C Riordan array((1-x)/(1+x), x*(1-x)/(1+x)). - _Philippe Deléham_, Jan 05 2014

%H Paul Barry, <a href="http://arxiv.org/abs/1311.2292">Laurent Biorthogonal Polynomials and Riordan Arrays</a>, arXiv preprint arXiv:1311.2292, 2013

%H Heinrich Niederhausen, <a href="http://arxiv.org/abs/1105.3713">Inverses of Motzkin and Schroeder Paths</a>, arXiv preprint arXiv:1105.3713, 2011.

%F Columns are generated by (1-x)^k/(1+x)^k

%F T(n,k)=(-1)^(n+k)*A113413(n,k). - _Philippe Deléham_, Jan 05 2014

%F T(n,k)=T(n-1,k-1)-T(n-1,k)-T(n-2,k-1), T(0,0)=1, T(1,0)=-2, T(1,1)=1, T(n,k)=0 if k<0 or if k>n. - _Philippe Deléham_, Jan 05 2014

%e Rows are {1}, {-2,1}, {2,-4,1}, {-2,8,-6,1}, ...

%Y Cf. A035607, A080247.

%K easy,sign,tabl

%O 0,2

%A _Paul Barry_, Feb 15 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 15:42 EDT 2024. Contains 371960 sequences. (Running on oeis4.)