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.

A303313 Number of nX7 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 A303313 #4 Apr 21 2018 12:47:38
%S A303313 21,23,158,439,1799,7096,26184,100128,387892,1473950,5617780,21537368,
%T A303313 82283698,314136752,1201134460,4591062616,17541004106,67038118694,
%U A303313 256214474112,979116873266,3741800363318,14300090089956,54649561868376
%N A303313 Number of nX7 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 A303313 Column 7 of A303314.
%H A303313 R. H. Hardin, <a href="/A303313/b303313.txt">Table of n, a(n) for n = 1..210</a>
%F A303313 Empirical: a(n) = a(n-1) +a(n-2) +36*a(n-3) +23*a(n-4) +15*a(n-5) -252*a(n-6) -288*a(n-7) -81*a(n-8) +830*a(n-9) +496*a(n-10) +172*a(n-11) -720*a(n-12) -184*a(n-13) -396*a(n-14) +352*a(n-15) -248*a(n-16) +112*a(n-17) -176*a(n-18) -64*a(n-20) for n>23
%e A303313 Some solutions for n=5
%e A303313 ..0..1..0..1..0..0..0. .0..1..0..1..0..1..0. .0..0..1..0..1..0..1
%e A303313 ..0..1..1..1..0..1..0. .0..1..0..0..0..1..0. .1..1..1..0..1..0..1
%e A303313 ..0..1..0..1..0..1..0. .0..1..0..1..0..1..0. .1..0..1..0..1..1..1
%e A303313 ..0..0..0..1..0..1..0. .0..1..1..1..0..1..0. .1..0..1..0..1..0..1
%e A303313 ..1..1..0..1..0..0..0. .0..1..0..1..0..1..0. .1..1..1..0..1..0..1
%Y A303313 Cf. A303314.
%K A303313 nonn
%O A303313 1,1
%A A303313 _R. H. Hardin_, Apr 21 2018