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.

A296322 Number of n X 3 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1s.

This page as a plain text file.
%I A296322 #8 Feb 23 2019 04:21:36
%S A296322 1,5,11,23,54,122,278,634,1438,3274,7451,16943,38547,87691,199477,
%T A296322 453789,1032300,2348324,5342108,12152500,27645148,62888676,143062485,
%U A296322 325446157,740342261,1684169937,3831239423,8715507347,19826499874,45102377086
%N A296322 Number of n X 3 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1s.
%H A296322 R. H. Hardin, <a href="/A296322/b296322.txt">Table of n, a(n) for n = 1..210</a>
%F A296322 Empirical: a(n) = 2*a(n-1) - a(n-2) + 4*a(n-3) - 2*a(n-4) + 4*a(n-5) - 3*a(n-6) + 2*a(n-7) - a(n-8).
%F A296322 Empirical g.f.: x*(1 + 3*x + 2*x^2 + 2*x^3 + x^4 - x^5 + x^6 - x^7) / ((1 + x^2)*(1 - 2*x - 2*x^3 + 2*x^4 - 2*x^5 + x^6)). - _Colin Barker_, Feb 23 2019
%e A296322 Some solutions for n=5:
%e A296322 ..1..1..0. .0..0..1. .0..0..0. .0..0..0. .1..1..0. .0..0..0. .0..1..0
%e A296322 ..1..0..0. .0..1..1. .0..0..0. .0..0..0. .1..0..0. .0..1..1. .1..1..0
%e A296322 ..0..0..0. .0..0..0. .0..0..0. .1..1..0. .0..1..1. .0..1..0. .0..0..0
%e A296322 ..0..1..0. .0..1..0. .0..0..1. .1..0..0. .1..0..1. .0..0..0. .0..1..0
%e A296322 ..1..1..0. .1..1..0. .0..1..1. .0..0..0. .1..1..0. .0..0..0. .1..1..0
%Y A296322 Column 3 of A296327.
%K A296322 nonn
%O A296322 1,2
%A A296322 _R. H. Hardin_, Dec 10 2017