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.

A297679 Number of nX5 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 A297679 #4 Jan 03 2018 09:19:45
%S A297679 24,219,2790,32911,401678,4870764,59210634,719647644,8748946600,
%T A297679 106360216813,1293051641215,15720067945295,191114672847915,
%U A297679 2323452694839402,28247100678589725,343410814460992551
%N A297679 Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s.
%C A297679 Column 5 of A297682.
%H A297679 R. H. Hardin, <a href="/A297679/b297679.txt">Table of n, a(n) for n = 1..210</a>
%F A297679 Empirical: a(n) = 13*a(n-1) -13*a(n-2) +103*a(n-3) -631*a(n-4) -2904*a(n-5) +4228*a(n-6) -9174*a(n-7) +33373*a(n-8) -11504*a(n-9) +48969*a(n-10) -94831*a(n-11) +2069*a(n-12) -31085*a(n-13) -9102*a(n-14) +78809*a(n-15) -13808*a(n-16) +49758*a(n-17) -54323*a(n-18) +6349*a(n-19) +12263*a(n-20) -9120*a(n-21) +1613*a(n-22) -13130*a(n-23) +13637*a(n-24) -72*a(n-25) -8310*a(n-26) +1120*a(n-27) +2320*a(n-28) +128*a(n-29) -192*a(n-30)
%e A297679 Some solutions for n=4
%e A297679 ..0..0..1..0..1. .1..0..0..0..1. .1..1..0..1..0. .1..0..0..0..0
%e A297679 ..0..0..1..0..1. .1..0..1..0..1. .0..0..0..0..1. .0..1..0..1..0
%e A297679 ..0..0..0..0..1. .0..0..1..1..0. .1..1..0..0..0. .0..0..0..0..0
%e A297679 ..1..0..0..0..1. .1..0..0..0..1. .0..0..0..1..0. .1..0..0..1..0
%Y A297679 Cf. A297682.
%K A297679 nonn
%O A297679 1,1
%A A297679 _R. H. Hardin_, Jan 03 2018