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.

A295270 Number of n X 3 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1 or 4 1s.

Original entry on oeis.org

7, 33, 164, 811, 4035, 19997, 99245, 492401, 2443097, 12121712, 60143345, 298407987, 1480586061, 7346099129, 36448521869, 180843564461, 897276298340, 4451940313371, 22088817679653, 109596228179271, 543774384192739
Offset: 1

Views

Author

R. H. Hardin, Nov 19 2017

Keywords

Comments

Column 3 of A295275.

Examples

			Some solutions for n=7:
  0 1 0    1 0 0    0 0 0    1 0 0    0 1 0    0 1 1    0 0 0
  1 1 1    0 0 1    0 0 1    0 1 0    1 0 0    1 0 0    1 0 0
  0 1 0    0 0 0    0 0 0    1 0 0    0 0 1    1 0 0    0 0 1
  1 0 0    1 0 0    1 0 1    1 0 0    0 0 1    0 0 0    0 0 0
  0 0 1    0 1 0    0 0 0    0 0 0    1 1 0    1 0 0    0 1 0
  1 0 0    1 0 0    0 1 0    0 0 0    0 0 0    0 0 1    1 0 0
  0 1 1    0 1 1    0 0 0    0 0 0    1 0 1    1 0 0    0 0 0
		

Crossrefs

Cf. A295275.

Formula

Empirical: a(n) = 2*a(n-1) + 10*a(n-2) + 20*a(n-3) + 17*a(n-4) - a(n-5) - 9*a(n-6) - 12*a(n-7) - a(n-8) - a(n-9) + a(n-10).
Empirical formula is true: see link. - Robert Israel, Nov 19 2017