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.

A297592 Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s.

This page as a plain text file.
%I A297592 #4 Jan 01 2018 12:05:03
%S A297592 6,33,145,752,3747,18577,93150,464697,2320289,11591504,57880641,
%T A297592 289072233,1443683308,7209863009,36007227773,179824937844,
%U A297592 898069917949,4485086714025,22399136063860,111864365243177,558666033595587
%N A297592 Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s.
%C A297592 Column 5 of A297595.
%H A297592 R. H. Hardin, <a href="/A297592/b297592.txt">Table of n, a(n) for n = 1..210</a>
%F A297592 Empirical: a(n) = a(n-1) +8*a(n-2) +45*a(n-3) +77*a(n-4) +50*a(n-5) -236*a(n-6) -474*a(n-7) -291*a(n-8) -115*a(n-9) -109*a(n-10) +780*a(n-11) +984*a(n-12) +1210*a(n-13) -80*a(n-14) +684*a(n-15) +136*a(n-16) -594*a(n-17) -247*a(n-18) -179*a(n-19) -97*a(n-20) -32*a(n-21) +16*a(n-22)
%e A297592 Some solutions for n=7
%e A297592 ..0..0..0..0..1. .0..0..0..1..0. .0..0..0..0..0. .0..1..0..0..0
%e A297592 ..0..1..0..1..0. .0..0..1..0..0. .0..0..1..1..0. .1..0..0..1..0
%e A297592 ..1..0..0..0..0. .0..0..1..0..0. .0..0..0..0..0. .0..0..1..0..0
%e A297592 ..0..0..0..1..1. .0..0..0..1..0. .1..1..0..1..1. .1..0..0..0..0
%e A297592 ..0..1..0..0..0. .0..1..0..1..0. .0..0..0..0..0. .0..1..0..1..1
%e A297592 ..1..0..0..1..0. .0..1..1..0..0. .0..0..0..0..1. .0..0..0..0..0
%e A297592 ..0..0..0..0..1. .0..1..0..1..0. .1..1..0..1..0. .0..0..0..0..0
%Y A297592 Cf. A297595.
%K A297592 nonn
%O A297592 1,1
%A A297592 _R. H. Hardin_, Jan 01 2018