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.

A301445 Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A301445 #4 Mar 21 2018 11:53:06
%S A301445 4,29,171,1008,5930,34976,206266,1216562,7175157,42318566,249591629,
%T A301445 1472072549,8682172154,51206792942,302013780922,1781254373986,
%U A301445 10505703200049,61961840678551,365446236883416,2155374188205965
%N A301445 Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
%C A301445 Column 3 of A301450.
%H A301445 R. H. Hardin, <a href="/A301445/b301445.txt">Table of n, a(n) for n = 1..210</a>
%F A301445 Empirical: a(n) = 5*a(n-1) +7*a(n-2) -10*a(n-3) -a(n-4) +7*a(n-5) -17*a(n-6) +5*a(n-8) -11*a(n-9) +5*a(n-10) -2*a(n-12) +2*a(n-13)
%e A301445 Some solutions for n=5
%e A301445 ..0..0..1. .0..0..1. .0..1..1. .0..0..0. .0..1..1. .0..0..1. .0..1..0
%e A301445 ..1..0..0. .0..1..1. .1..0..1. .1..0..1. .1..0..0. .0..1..1. .1..0..0
%e A301445 ..1..1..1. .0..0..1. .1..0..1. .0..1..1. .0..0..0. .1..0..0. .0..1..1
%e A301445 ..0..1..0. .1..0..0. .0..0..0. .0..0..0. .0..1..0. .0..1..1. .1..0..0
%e A301445 ..0..0..1. .1..1..0. .1..1..0. .1..0..0. .0..1..0. .0..0..1. .1..1..1
%Y A301445 Cf. A301450.
%K A301445 nonn
%O A301445 1,1
%A A301445 _R. H. Hardin_, Mar 21 2018