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.

A300203 Number of n X 3 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

4, 32, 248, 1933, 15070, 117494, 916061, 7142233, 55685704, 434163629, 3385035032, 26392036123, 205770269515, 1604325017633, 12508409345459, 97524069396190, 760363995846334, 5928315027859268, 46221177306565661, 360371745017815198
Offset: 1

Views

Author

R. H. Hardin, Feb 28 2018

Keywords

Comments

Column 3 of A300208.

Examples

			Some solutions for n=5;
  0 1 0    0 0 1    0 1 1    0 0 1    0 0 0    0 1 0    0 0 1
  1 0 0    0 1 1    1 0 1    1 0 0    1 1 0    0 0 1    0 1 0
  0 1 1    0 0 0    1 0 0    0 1 0    1 1 0    0 1 0    0 0 1
  1 1 1    0 1 1    1 1 1    1 0 0    0 0 1    1 0 1    0 0 0
  0 0 0    0 0 1    0 0 1    0 0 1    0 0 0    0 1 1    0 0 1
		

Crossrefs

Cf. A300208.

Formula

Empirical: a(n) = 8*a(n-1) - 2*a(n-2) + 5*a(n-3) - 13*a(n-4) - 6*a(n-5).
Empirical g.f.: -x*(-6*x^4-7*x^3+4)/(-6*x^5-13*x^4+5*x^3-2*x^2+8*x-1). - Simon Plouffe, Jun 20 2018