cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

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
Offset: 0

Views

Author

Paul Curtz, Jan 30 2008

Keywords

Comments

Recurrence in A052947.

Crossrefs

Cf. A078050.

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)