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.

A298916 Number of nX7 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.

This page as a plain text file.
%I A298916 #4 Jan 29 2018 07:45:11
%S A298916 1,8,8,9,15,24,40,76,141,277,570,1171,2441,5157,10913,23193,49468,
%T A298916 105598,225691,482849,1033370,2212340,4737746,10147163,21735151,
%U A298916 46560372,99744293,213684681,457793103,980778481,2101245689,4501796828,9644879742
%N A298916 Number of nX7 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.
%C A298916 Column 7 of A298917.
%H A298916 R. H. Hardin, <a href="/A298916/b298916.txt">Table of n, a(n) for n = 1..210</a>
%F A298916 Empirical: a(n) = 4*a(n-1) -5*a(n-2) +5*a(n-3) -9*a(n-4) +7*a(n-5) -2*a(n-6) -a(n-7) +7*a(n-8) -5*a(n-9) +3*a(n-10) -2*a(n-11) -a(n-12) +a(n-13) -a(n-14) for n>15
%e A298916 Some solutions for n=5
%e A298916 ..0..0..0..0..1..1..1. .0..0..0..0..0..1..1. .0..0..0..0..0..0..0
%e A298916 ..0..0..0..0..1..1..1. .0..0..0..0..0..1..1. .0..0..0..0..0..0..0
%e A298916 ..0..0..0..0..1..1..1. .0..0..0..0..0..1..1. .1..1..1..1..1..1..1
%e A298916 ..0..0..0..0..1..1..1. .0..0..0..0..0..1..1. .1..1..1..1..1..1..1
%e A298916 ..0..0..0..0..1..1..1. .0..0..0..0..0..1..1. .1..1..1..1..1..1..1
%Y A298916 Cf. A298917.
%K A298916 nonn
%O A298916 1,2
%A A298916 _R. H. Hardin_, Jan 29 2018