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.

A297678 Number of nX4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s.

This page as a plain text file.
%I A297678 #4 Jan 03 2018 09:18:57
%S A297678 13,80,629,4633,34872,260924,1955750,14651847,109783269,822547725,
%T A297678 6162992737,46176452589,345979170190,2592263829464,19422650189445,
%U A297678 145525052534819,1090352803546358,8169515919608631,61210454258421286
%N A297678 Number of nX4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s.
%C A297678 Column 4 of A297682.
%H A297678 R. H. Hardin, <a href="/A297678/b297678.txt">Table of n, a(n) for n = 1..210</a>
%F A297678 Empirical: a(n) = 6*a(n-1) +10*a(n-2) +6*a(n-3) +26*a(n-4) -31*a(n-5) -a(n-6) -165*a(n-7) -22*a(n-8) +181*a(n-9) +39*a(n-10) -54*a(n-11) -15*a(n-12) +6*a(n-13) -4*a(n-14) -a(n-15) +2*a(n-16)
%e A297678 Some solutions for n=5
%e A297678 ..1..0..0..0. .1..0..1..0. .0..0..0..1. .1..1..0..0. .0..0..0..0
%e A297678 ..0..1..0..0. .1..0..1..0. .1..1..0..0. .0..0..0..1. .0..0..0..1
%e A297678 ..0..1..0..1. .1..1..1..0. .0..0..0..0. .0..0..0..0. .1..0..0..1
%e A297678 ..0..0..0..0. .0..0..0..0. .1..0..0..1. .0..0..0..0. .0..0..0..1
%e A297678 ..0..1..0..1. .0..0..0..0. .1..0..1..0. .0..0..0..0. .1..0..1..0
%Y A297678 Cf. A297682.
%K A297678 nonn
%O A297678 1,1
%A A297678 _R. H. Hardin_, Jan 03 2018