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.

A296316 Number of n X 4 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 neighboring 1.

This page as a plain text file.
%I A296316 #6 Sep 04 2022 11:27:43
%S A296316 4,27,96,434,1970,8470,37431,164807,723019,3180521,13980961,61446863,
%T A296316 270126432,1187392203,5219407184,22943336005,100852689192,
%U A296316 443321760393,1948727874003,8566095221354,37654312064817,165518509370616
%N A296316 Number of n X 4 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 neighboring 1.
%C A296316 Column 4 of A296320.
%H A296316 R. H. Hardin, <a href="/A296316/b296316.txt">Table of n, a(n) for n = 1..210</a>
%F A296316 Empirical: a(n) = a(n-1) +6*a(n-2) +29*a(n-3) +30*a(n-4) +61*a(n-5) +9*a(n-6) +73*a(n-7) -93*a(n-8) +134*a(n-9) -201*a(n-10) +173*a(n-11) -179*a(n-12) +107*a(n-13) -a(n-14) -30*a(n-15) -15*a(n-16) +22*a(n-17) -3*a(n-18) -2*a(n-19) -a(n-20) +a(n-21).
%e A296316 Some solutions for n=5
%e A296316 ..0..0..0..0. .1..0..0..0. .0..0..0..0. .0..0..1..0. .0..0..0..0
%e A296316 ..0..0..1..0. .1..0..0..1. .0..0..0..0. .0..1..0..0. .1..0..0..0
%e A296316 ..0..1..0..0. .0..1..0..1. .0..1..0..1. .0..0..1..1. .1..0..0..0
%e A296316 ..0..0..1..1. .1..0..0..0. .1..0..0..1. .1..0..0..0. .0..0..0..0
%e A296316 ..0..0..0..0. .0..1..1..0. .0..0..0..0. .1..0..1..1. .0..0..0..0
%Y A296316 Cf. A296320.
%K A296316 nonn
%O A296316 1,1
%A A296316 _R. H. Hardin_, Dec 10 2017