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.

A318072 Number of nX5 0..1 arrays with every element unequal to 0, 1, 2 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A318072 #4 Aug 15 2018 13:18:59
%S A318072 16,42,81,149,316,854,2195,5752,15565,41364,110930,299210,802420,
%T A318072 2158664,5810654,15618316,42022876,113058411,304076748,818075794,
%U A318072 2200737667,5919964491,15925927942,42842509441,115250505252,310041060554
%N A318072 Number of nX5 0..1 arrays with every element unequal to 0, 1, 2 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
%C A318072 Column 5 of A318075.
%H A318072 R. H. Hardin, <a href="/A318072/b318072.txt">Table of n, a(n) for n = 1..210</a>
%F A318072 Empirical: a(n) = 3*a(n-1) -2*a(n-2) +8*a(n-3) -16*a(n-4) +16*a(n-5) -27*a(n-6) +15*a(n-7) -6*a(n-8) +4*a(n-9) -3*a(n-10) +29*a(n-11) -9*a(n-12) +17*a(n-13) -7*a(n-14) -11*a(n-15) -13*a(n-16) -7*a(n-17) +5*a(n-18) -7*a(n-19) +a(n-20) +11*a(n-21) -2*a(n-22) +2*a(n-23) +4*a(n-24) -4*a(n-25) +5*a(n-26) -5*a(n-27) -a(n-28) +a(n-29) for n>33
%e A318072 Some solutions for n=5
%e A318072 ..0..1..1..1..1. .0..0..0..0..0. .0..0..0..1..0. .0..0..1..1..1
%e A318072 ..1..1..1..1..1. .0..1..1..0..0. .0..0..1..1..0. .0..1..1..0..1
%e A318072 ..1..0..0..1..1. .0..0..0..1..0. .0..1..1..1..0. .1..1..0..1..1
%e A318072 ..1..1..1..1..1. .0..0..0..1..0. .1..1..1..1..0. .1..1..1..1..0
%e A318072 ..1..1..1..1..0. .0..0..0..0..1. .1..1..1..1..0. .1..1..1..0..0
%Y A318072 Cf. A318075.
%K A318072 nonn
%O A318072 1,1
%A A318072 _R. H. Hardin_, Aug 15 2018