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.

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

This page as a plain text file.
%I A297585 #4 Jan 01 2018 11:14:37
%S A297585 1,20,102,254,1017,5263,20771,76340,320326,1353690,5389975,21589173,
%T A297585 88747475,362176212,1462891858,5938102840,24195113809,98303450371,
%U A297585 398918472477,1621218682358,6590614515512,26773290621678,108760910018039
%N A297585 Number of 4Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 4 neighboring 1s.
%C A297585 Row 4 of A297582.
%H A297585 R. H. Hardin, <a href="/A297585/b297585.txt">Table of n, a(n) for n = 1..210</a>
%F A297585 Empirical: a(n) = a(n-1) +4*a(n-2) +23*a(n-3) +59*a(n-4) -6*a(n-5) -158*a(n-6) -137*a(n-7) -2*a(n-8) +54*a(n-9) +177*a(n-10) -230*a(n-11) -89*a(n-12) +168*a(n-13) -28*a(n-14) -37*a(n-15) +4*a(n-16) +2*a(n-17)
%e A297585 Some solutions for n=7
%e A297585 ..0..0..0..0..0..1..1. .0..0..1..0..0..0..0. .0..0..0..0..1..1..1
%e A297585 ..1..0..0..1..0..0..0. .0..1..0..0..0..0..1. .0..1..1..0..1..0..1
%e A297585 ..0..1..0..1..1..1..0. .0..0..0..0..1..1..0. .0..0..0..0..1..0..1
%e A297585 ..0..0..0..0..0..1..0. .0..0..0..0..1..0..1. .0..0..0..0..1..1..1
%Y A297585 Cf. A297582.
%K A297585 nonn
%O A297585 1,2
%A A297585 _R. H. Hardin_, Jan 01 2018