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.

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

This page as a plain text file.
%I A302167 #4 Apr 02 2018 14:52:14
%S A302167 16,21,31,73,140,296,603,1288,2584,5456,11189,23561,48423,101409,
%T A302167 209594,438175,906900,1891425,3921725,8172996,16960434,35311533,
%U A302167 73325262,152605472,317023164,659531459,1370465497,2850564339,5924450361
%N A302167 Number of 5Xn 0..1 arrays with every element equal to 0, 1 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302167 Row 5 of A302163.
%H A302167 R. H. Hardin, <a href="/A302167/b302167.txt">Table of n, a(n) for n = 1..210</a>
%F A302167 Empirical: a(n) = a(n-1) +2*a(n-2) -a(n-3) +14*a(n-4) -10*a(n-5) -23*a(n-6) +5*a(n-7) -71*a(n-8) +44*a(n-9) +102*a(n-10) -14*a(n-11) +176*a(n-12) -115*a(n-13) -236*a(n-14) +43*a(n-15) -217*a(n-16) +199*a(n-17) +322*a(n-18) -95*a(n-19) +74*a(n-20) -223*a(n-21) -283*a(n-22) +111*a(n-23) +131*a(n-24) +140*a(n-25) +177*a(n-26) -75*a(n-27) -164*a(n-28) -39*a(n-29) -78*a(n-30) +40*a(n-31) +64*a(n-32) +6*a(n-33) +16*a(n-34) -12*a(n-35) -8*a(n-36) for n>40
%e A302167 Some solutions for n=5
%e A302167 ..0..1..0..1..0. .0..1..0..1..1. .0..1..0..0..1. .0..1..1..0..1
%e A302167 ..1..1..0..1..1. .0..1..1..0..1. .1..1..0..1..0. .1..0..1..0..0
%e A302167 ..0..1..0..1..0. .1..0..1..0..1. .0..1..0..1..0. .1..0..1..0..1
%e A302167 ..0..1..0..1..0. .1..0..1..0..1. .0..1..0..0..1. .0..0..1..0..1
%e A302167 ..0..1..1..0..0. .0..1..1..0..1. .0..0..1..0..1. .1..0..1..1..0
%Y A302167 Cf. A302163.
%K A302167 nonn
%O A302167 1,1
%A A302167 _R. H. Hardin_, Apr 02 2018