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!)
A134812 a(n) = 2a(n-2) + 4a(n-3), n >= 3. 2

%I #10 Jun 13 2015 00:52:33

%S 0,1,-1,1,2,-2,8,4,8,40,32,112,224,352,896,1600,3200,6784,12800,26368,

%T 52736,103936,210944,418816,837632,1681408,3350528,6713344,13426688,

%U 26828800,53706752,107364352,214728704,429555712,858914816,1718026240,3436052480,6871711744,13744209920

%N a(n) = 2a(n-2) + 4a(n-3), n >= 3.

%H Joshua Zucker, Feb 23 2008, <a href="/A134812/b134812.txt">Table of n, a(n) for n = 0..60</a>

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

%F G.f. x*(-1 + x + x^2) / ( (2*x-1)*(2*x^2 + 2*x + 1) ). - _R. J. Mathar_, Aug 11 2012

%F 20*a(n) = 2^n - 6*A078069(n), n>0. - _R. J. Mathar_, Aug 11 2012

%Y Cf. A134654.

%K sign,easy

%O 0,5

%A _Paul Curtz_, Jan 28 2008

%E More terms from _Joshua Zucker_, Feb 23 2008

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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)