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!)
A134270 a(n)=2a(n-1)+a(n-2)-4a(n-4). 1

%I #7 Jul 31 2015 21:11:57

%S 1,1,3,7,13,29,59,119,245,493,995,2007,4029,8093,16235,32535,65189,

%T 130541,261331,523063,1046701,2094301,4189979,8382007,16767189,

%U 33539181,67085635,134182423,268381725,536789149,1073617483,2147294423,4294679429,8589496685

%N a(n)=2a(n-1)+a(n-2)-4a(n-4).

%H Harvey P. Dale, <a href="/A134270/b134270.txt">Table of n, a(n) for n = 0..1000</a>

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

%F O.g.f.: (1+x)*x/(2*x^3+x^2-1)-1/(2*x-1) . a(n) = -|A078028(n-1)| + 2^n . - _R. J. Mathar_, Feb 01 2008

%t LinearRecurrence[{2,1,0,-4},{1,1,3,7},40] (* _Harvey P. Dale_, Jan 16 2013 *)

%K nonn

%O 0,3

%A _Paul Curtz_, Jan 30 2008

%E More terms from _Harvey P. Dale_, Jan 16 2013

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.)