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.

A303679 Number of nX5 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.

This page as a plain text file.
%I A303679 #4 Apr 28 2018 09:21:17
%S A303679 8,31,25,44,76,110,150,212,306,458,684,1006,1462,2132,3122,4586,6732,
%T A303679 9870,14454,21172,31026,45482,66668,97710,143190,209844,307538,450730,
%U A303679 660588,968142,1418870,2079444,3047570,4466442,6545900,9593486,14059926
%N A303679 Number of nX5 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.
%C A303679 Column 5 of A303682.
%H A303679 R. H. Hardin, <a href="/A303679/b303679.txt">Table of n, a(n) for n = 1..210</a>
%F A303679 Empirical: a(n) = a(n-1) +a(n-4) +a(n-6) for n>10
%e A303679 Some solutions for n=5
%e A303679 ..0..0..1..1..1. .0..0..0..0..1. .0..1..1..0..0. .0..0..0..1..1
%e A303679 ..0..1..1..1..1. .0..0..0..1..1. .1..1..1..1..0. .0..0..0..0..1
%e A303679 ..1..1..1..1..0. .0..0..1..1..1. .1..1..1..1..1. .0..0..0..0..0
%e A303679 ..1..1..1..0..0. .0..1..1..1..1. .1..1..1..1..1. .1..0..0..0..0
%e A303679 ..1..1..0..0..0. .1..1..1..1..0. .1..1..1..1..1. .1..1..0..0..0
%Y A303679 Cf. A303682.
%K A303679 nonn
%O A303679 1,1
%A A303679 _R. H. Hardin_, Apr 28 2018