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.

A159287 Expansion of x^2/(1-x^2-2*x^3).

Original entry on oeis.org

0, 0, 1, 0, 1, 2, 1, 4, 5, 6, 13, 16, 25, 42, 57, 92, 141, 206, 325, 488, 737, 1138, 1713, 2612, 3989, 6038, 9213, 14016, 21289, 32442, 49321, 75020, 114205, 173662, 264245, 402072, 611569, 930562, 1415713, 2153700, 3276837, 4985126, 7584237, 11538800
Offset: 0

Views

Author

Creighton Dement, Apr 08 2009

Keywords

Comments

A floretion-generated sequence: 'i + 0.5('ij' + 'ik' + 'ji' + 'jk' + 'ki' + 'kj').
From Greg Dresden, Nov 15 2024: (Start)
a(n) is the number of ways to tile a 2 X (n+1) board with L-shaped trominos and S-shaped quadrominos, where the first tile must be an upright L. For example, here are the a(7)=4 ways to tile a 2 X 8 board:
| | | | | | | | | | | |
|_|_||__|___| |_|___|||___|
| | | | | | | | | | | |
|_|_|_|___|| |__|___||__|_| (End)

Crossrefs

Essentially the same as A052947.

Programs

Formula

G.f.: x^2/(1-x^2-2*x^3).
a(n) = A052947(n-2). - R. J. Mathar, Nov 10 2009
a(n) = a(n-2) + 2*a(n-3). - Wesley Ivan Hurt, May 23 2023
From Greg Dresden, Nov 17 2024: (Start)
a(2*n+1) = 2*a(n)^2 + 2*a(n+1)*a(n+2).
a(3*n+1) = Sum_{i=1..n} a(3*i-2)*2^(n-i). (End)