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.

A262421 Number of (2+1) X (n+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

5, 4, 45, 114, 709, 2892, 15293, 72370, 367125, 1808844, 9078925, 45214674, 226307429, 1130307532, 5653140573, 28257215730, 141297157045, 706426855884, 3532211260205, 17660645718034, 88303765183749, 441515959527372
Offset: 1

Views

Author

R. H. Hardin, Sep 22 2015

Keywords

Examples

			Some solutions for n=4:
..1..1..0..0..0....0..1..1..0..0....1..1..1..1..0....1..1..0..1..1
..0..1..0..0..1....1..1..0..1..1....1..1..0..0..0....0..1..1..0..0
..1..1..1..1..0....0..1..1..0..0....1..1..0..1..1....1..1..0..0..0
		

Crossrefs

Row 2 of A262420.

Formula

Empirical: a(n) = 5*a(n-1) + 12*a(n-2) - 60*a(n-3) - 39*a(n-4) + 195*a(n-5) + 28*a(n-6) - 140*a(n-7).
Empirical g.f.: x*(5 - 21*x - 35*x^2 + 141*x^3 + 34*x^4 - 140*x^5) / ((1 - x)*(1 + x)*(1 - 2*x)*(1 + 2*x)*(1 - 5*x)*(1 - 7*x^2)). - Colin Barker, Dec 31 2018