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.

A297598 Number of 5Xn 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 A297598 #4 Jan 01 2018 12:10:44
%S A297598 1,41,205,577,3747,23066,103673,514290,2834897,14505899,72679629,
%T A297598 377711106,1958960586,10014143622,51449828843,265527351855,
%U A297598 1365723938126,7018444981802,36127198341369,185940488937815,956389182435753
%N A297598 Number of 5Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s.
%C A297598 Row 5 of A297595.
%H A297598 R. H. Hardin, <a href="/A297598/b297598.txt">Table of n, a(n) for n = 1..210</a>
%F A297598 Empirical: a(n) = a(n-1) +4*a(n-2) +69*a(n-3) +140*a(n-4) +75*a(n-5) -819*a(n-6) -2333*a(n-7) -3025*a(n-8) +2643*a(n-9) +10976*a(n-10) +11484*a(n-11) +8292*a(n-12) -9866*a(n-13) -21676*a(n-14) -50620*a(n-15) -23742*a(n-16) +4580*a(n-17) +75360*a(n-18) +31530*a(n-19) +13258*a(n-20) -56614*a(n-21) -22102*a(n-22) -18586*a(n-23) +348*a(n-24) -4914*a(n-25) -882*a(n-26)
%e A297598 Some solutions for n=7
%e A297598 ..0..1..0..0..0..0..0. .0..1..0..0..0..0..0. .0..0..1..0..0..0..0
%e A297598 ..0..0..1..0..0..0..0. .1..0..0..0..1..1..0. .0..1..0..0..0..0..0
%e A297598 ..0..0..0..0..1..1..0. .1..0..1..0..0..0..0. .0..1..0..1..0..0..0
%e A297598 ..1..0..0..0..0..0..0. .1..1..1..0..1..1..0. .0..0..1..1..0..0..0
%e A297598 ..0..1..0..0..1..1..0. .1..0..0..0..0..0..0. .0..1..0..1..0..1..1
%Y A297598 Cf. A297595.
%K A297598 nonn
%O A297598 1,2
%A A297598 _R. H. Hardin_, Jan 01 2018