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.

A318339 Number of nX4 0..1 arrays with every element unequal to 0, 1, 2 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A318339 #4 Aug 24 2018 11:02:18
%S A318339 8,20,36,67,148,343,817,1975,4788,11644,28327,68949,167840,408591,
%T A318339 994711,2421617,5895464,14352589,34941627,85066013,207094729,
%U A318339 504175889,1227425339,2988189330,7274801283,17710636103,43116865936,104968794797
%N A318339 Number of nX4 0..1 arrays with every element unequal to 0, 1, 2 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
%C A318339 Column 4 of A318343.
%H A318339 R. H. Hardin, <a href="/A318339/b318339.txt">Table of n, a(n) for n = 1..210</a>
%F A318339 Empirical: a(n) = a(n-1) +4*a(n-2) +a(n-3) -5*a(n-4) -2*a(n-5) +2*a(n-6) +a(n-7) -a(n-8) for n>9
%e A318339 Some solutions for n=5
%e A318339 ..0..0..0..0. .0..0..1..1. .0..1..1..0. .0..1..1..1. .0..0..0..0
%e A318339 ..0..0..0..0. .0..1..1..1. .1..1..0..0. .1..1..1..1. .0..0..0..0
%e A318339 ..0..0..0..0. .1..1..1..1. .1..0..0..0. .1..1..1..1. .0..0..1..0
%e A318339 ..0..0..1..0. .1..0..1..1. .0..0..0..0. .0..0..0..0. .0..0..0..0
%e A318339 ..0..0..0..1. .1..1..1..1. .0..0..0..1. .0..0..0..1. .0..0..0..1
%Y A318339 Cf. A318343.
%K A318339 nonn
%O A318339 1,1
%A A318339 _R. H. Hardin_, Aug 24 2018