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.

A190091 Number of rhombuses on a (n+1) X 3 grid.

Original entry on oeis.org

2, 6, 10, 15, 20, 26, 32, 39, 46, 54, 62, 71, 80, 90, 100, 111, 122, 134, 146, 159, 172, 186, 200, 215, 230, 246, 262, 279, 296, 314, 332, 351, 370, 390, 410, 431, 452, 474, 496, 519, 542, 566, 590, 615, 640, 666, 692, 719, 746, 774, 802, 831, 860, 890, 920, 951, 982
Offset: 1

Views

Author

R. H. Hardin, May 04 2011

Keywords

Comments

Column 2 of A190098.

Examples

			All solutions for n=3:
..0..1....2..0....0..1....1..1....1..1....1..0....0..0....0..0....2..1....1..0
..1..0....2..1....0..2....2..0....1..2....1..2....0..1....0..2....2..2....1..1
..2..1....3..1....1..2....3..1....2..2....3..2....1..1....2..2....3..2....2..1
..1..2....3..0....1..1....2..2....2..1....3..0....1..0....2..0....3..1....2..0
		

Crossrefs

Cf. A190098.

Formula

Empirical: a(n) = 2*a(n-1) -2*a(n-3) +a(n-4).
Conjectures from Colin Barker, May 04 2018: (Start)
G.f.: x*(2 + 2*x - 2*x^2 - x^3) / ((1 - x)^3*(1 + x)).
a(n) = (n^2 + 12*n - 4) / 4 for n even.
a(n) = (n^2 + 12*n - 5) / 4 for n odd.
(End)