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.

A303316 Number of 4Xn 0..1 arrays with every element equal to 0, 1, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A303316 #4 Apr 21 2018 12:49:55
%S A303316 8,6,11,36,50,128,439,1085,2431,6452,17455,43514,108524,281615,726261,
%T A303316 1839731,4685152,12025643,30754258,78396104,200278695,512290781,
%U A303316 1308785863,3342222476,8540451095,21826102586,55761123412,142456533311
%N A303316 Number of 4Xn 0..1 arrays with every element equal to 0, 1, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A303316 Row 4 of A303314.
%H A303316 R. H. Hardin, <a href="/A303316/b303316.txt">Table of n, a(n) for n = 1..210</a>
%F A303316 Empirical: a(n) = a(n-1) +a(n-2) +5*a(n-3) +9*a(n-4) -3*a(n-5) -7*a(n-6) -2*a(n-7) for n>11
%e A303316 Some solutions for n=5
%e A303316 ..0..1..1..1..0. .0..1..0..1..0. .0..0..0..1..0. .0..1..0..1..0
%e A303316 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0
%e A303316 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..0..0
%e A303316 ..0..1..1..1..0. .0..0..0..1..0. .0..0..0..1..0. .0..1..0..1..1
%Y A303316 Cf. A303314.
%K A303316 nonn
%O A303316 1,1
%A A303316 _R. H. Hardin_, Apr 21 2018