login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134271 a(n) = a(n-2) + 2*a(n-3), n > 3; with a(0)=0, a(1)=1, a(2)=2, a(3)=0. 0
0, 1, 2, 0, 4, 4, 4, 12, 12, 20, 36, 44, 76, 116, 164, 268, 396, 596, 932, 1388, 2124, 3252, 4900, 7500, 11404, 17300, 26404, 40108, 61004, 92916, 141220, 214924, 327052, 497364, 756900, 1151468, 1751628, 2665268, 4054564, 6168524, 9385100 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Recurrence in A052947.

LINKS

Table of n, a(n) for n=0..40.

Index entries for linear recurrences with constant coefficients, signature (0,1,2).

FORMULA

From R. J. Mathar, Feb 01 2008: (Start)

O.g.f.: 1/2 + (1/2)*(-2*x-5*x^2+1)/(-1+x^2+2*x^3).

a(n) = A052947(n-1) + 2*A052947(n-2) - A052947(n-3). (End)

CROSSREFS

Cf. A078050.

Sequence in context: A049797 A116578 A078050 * A094403 A244340 A316987

Adjacent sequences:  A134268 A134269 A134270 * A134272 A134273 A134274

KEYWORD

nonn,easy

AUTHOR

Paul Curtz, Jan 30 2008

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 21:32 EDT 2020. Contains 333117 sequences. (Running on oeis4.)