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.

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

This page as a plain text file.
%I A298186 #4 Jan 14 2018 09:39:49
%S A298186 0,8,8,9,10,14,19,27,38,58,90,142,225,362,587,959,1572,2587,4270,7067,
%T A298186 11718,19462,32366,53887,89799,149757,249902,417231,696895,1164423,
%U A298186 1946165,3253513,5440154,9097892,15216993,25454538,42583510,71244379
%N A298186 Number of nX7 0..1 arrays with every element equal to 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.
%C A298186 Column 7 of A298187.
%H A298186 R. H. Hardin, <a href="/A298186/b298186.txt">Table of n, a(n) for n = 1..210</a>
%F A298186 Empirical: a(n) = 3*a(n-1) -2*a(n-2) -a(n-3) +2*a(n-4) -2*a(n-5) +a(n-6) -a(n-7) +a(n-8) -a(n-10) +a(n-11) for n>12
%e A298186 Some solutions for n=7
%e A298186 ..0..0..0..0..0..1..1. .0..0..0..0..1..1..1. .0..0..0..1..1..0..0
%e A298186 ..0..0..0..0..0..1..1. .0..0..0..0..1..1..1. .0..0..0..1..1..0..0
%e A298186 ..0..0..0..0..0..1..1. .0..0..0..1..0..1..1. .0..0..0..1..1..0..0
%e A298186 ..0..0..0..0..0..1..1. .1..1..1..0..1..0..0. .0..0..0..1..1..0..0
%e A298186 ..0..0..0..0..0..1..1. .1..1..1..1..0..0..0. .0..0..0..1..1..0..0
%e A298186 ..0..0..0..0..0..1..1. .1..1..1..1..0..0..0. .0..0..0..1..1..0..0
%e A298186 ..0..0..0..0..0..1..1. .1..1..1..1..0..0..0. .0..0..0..1..1..0..0
%Y A298186 Cf. A298187.
%K A298186 nonn
%O A298186 1,2
%A A298186 _R. H. Hardin_, Jan 14 2018