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.

A303310 Number of nX4 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 A303310 #4 Apr 21 2018 12:45:40
%S A303310 5,5,17,36,74,165,361,783,1710,3744,8176,17851,39009,85239,186206,
%T A303310 406800,888794,1941803,4242301,9268393,20249240,44239542,96652372,
%U A303310 211161719,461336399,1007905991,2202025876,4810883806,10510594448,22963055655
%N A303310 Number of nX4 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 A303310 Column 4 of A303314.
%H A303310 R. H. Hardin, <a href="/A303310/b303310.txt">Table of n, a(n) for n = 1..210</a>
%F A303310 Empirical: a(n) = a(n-1) +a(n-2) +3*a(n-3) +2*a(n-4) -a(n-5) -2*a(n-6) -a(n-7) for n>10
%e A303310 Some solutions for n=5
%e A303310 ..0..0..0..1. .0..1..1..1. .0..1..0..0. .0..1..0..1. .0..1..1..1
%e A303310 ..0..1..0..1. .0..1..0..1. .0..1..1..1. .0..0..0..1. .0..1..0..1
%e A303310 ..0..1..0..1. .0..0..0..1. .0..1..0..1. .0..1..0..1. .0..1..0..1
%e A303310 ..0..1..0..1. .0..1..1..1. .0..1..0..1. .0..1..1..1. .0..1..0..1
%e A303310 ..0..1..0..1. .0..1..0..0. .0..1..0..1. .0..1..0..0. .0..0..0..1
%Y A303310 Cf. A303314.
%K A303310 nonn
%O A303310 1,1
%A A303310 _R. H. Hardin_, Apr 21 2018