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.

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

This page as a plain text file.
%I A317763 #4 Aug 06 2018 11:51:31
%S A317763 64,190,196,232,302,425,639,1012,1663,2801,4792,8278,14385,25088,
%T A317763 43852,76756,134466,235697,413288,724863,1271539,2230756,3913889,
%U A317763 6867349,12050002,21144516,37103735,65109496,114255232,200498730,351843854
%N A317763 Number of nX7 0..1 arrays with every element unequal to 0, 1 or 2 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
%C A317763 Column 7 of A317764.
%H A317763 R. H. Hardin, <a href="/A317763/b317763.txt">Table of n, a(n) for n = 1..210</a>
%F A317763 Empirical: a(n) = 3*a(n-1) -2*a(n-2) -a(n-4) +a(n-5) -a(n-6) +a(n-7) for n>11
%e A317763 Some solutions for n=5
%e A317763 ..0..1..1..1..1..0..0. .0..0..0..1..0..0..0. .0..0..0..0..1..1..1
%e A317763 ..1..1..1..1..0..0..0. .0..0..1..1..0..0..0. .0..0..0..1..1..1..1
%e A317763 ..1..1..1..0..0..0..0. .0..1..1..1..0..0..0. .0..0..1..1..1..1..0
%e A317763 ..1..1..0..0..0..0..1. .1..1..1..1..0..0..1. .0..1..1..1..1..0..0
%e A317763 ..1..0..0..0..0..1..1. .1..1..1..1..0..1..1. .1..1..1..1..0..0..0
%Y A317763 Cf. A317764.
%K A317763 nonn
%O A317763 1,1
%A A317763 _R. H. Hardin_, Aug 06 2018