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!)
A073358 Binomial transform, alternating in sign, of the tribonacci numbers. 2

%I #10 May 07 2017 22:44:25

%S 0,-1,-1,-2,-2,-2,0,4,12,24,40,56,64,48,-16,-160,-416,-800,-1280,

%T -1728,-1856,-1152,1152,6016,14336,26368,40704,52736,52736,24064,

%U -57344,-220160,-488448,-862208,-1284096,-1591296,-1458176,-348160

%N Binomial transform, alternating in sign, of the tribonacci numbers.

%D Sloane, N. J. A. and Plouffe, S. The Encyclopedia of Integer Sequences. San Diego, CA: Academic Press, 1995.

%H M. Bernstein and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.CO/0205301">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]

%H M. Bernstein and N. J. A. Sloane, <a href="/A003633/a003633_1.pdf">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-2).

%F a(n)=2*a(n-1)-2*a(n-3), a(0)=0, a(1)=-1, a(2)=-1. Generating function A(x)=x*(x-1)/(1-2x+2x^3).

%t h[n_] := h[n]=2*h[n-1]-2*h[n-3]; h[0]=0; h[1]=-1; h[2]=-1

%Y Cf. A000073, A073357.

%K easy,sign

%O 0,4

%A Mario Catalani (mario.catalani(AT)unito.it), Jul 30 2002

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 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)