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.

A297391 Number of n X 4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 neighboring 1.

This page as a plain text file.
%I A297391 #8 Feb 28 2019 06:22:49
%S A297391 4,13,37,126,385,1243,3924,12477,39625,125780,399527,1268481,4028320,
%T A297391 12791471,40619227,128985178,409588149,1300636903,4130132236,
%U A297391 13115120227,41646681705,132247843570,419949219621,1333536652989,4234607278278
%N A297391 Number of n X 4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 neighboring 1.
%H A297391 R. H. Hardin, <a href="/A297391/b297391.txt">Table of n, a(n) for n = 1..210</a>
%F A297391 Empirical: a(n) = a(n-1) + 6*a(n-2) + 4*a(n-3) - 3*a(n-4) - a(n-5) - 2*a(n-6) - a(n-7).
%F A297391 Empirical g.f.: x*(4 + 9*x - 5*x^3 - 3*x^4 - 3*x^5 - x^6) / (1 - x - 6*x^2 - 4*x^3 + 3*x^4 + x^5 + 2*x^6 + x^7). - _Colin Barker_, Feb 28 2019
%e A297391 Some solutions for n=5:
%e A297391 ..0..0..0..0. .0..0..1..1. .0..0..1..1. .0..1..0..0. .0..0..1..0
%e A297391 ..0..0..1..1. .0..0..0..0. .0..0..0..0. .1..0..0..0. .0..1..0..0
%e A297391 ..0..0..0..0. .0..0..0..0. .0..1..1..0. .0..0..0..0. .0..0..0..0
%e A297391 ..1..0..0..0. .0..1..0..0. .0..0..0..0. .0..0..1..1. .0..0..1..1
%e A297391 ..0..1..0..0. .1..0..0..0. .0..0..0..0. .0..0..0..0. .0..0..0..0
%Y A297391 Column 4 of A297395.
%K A297391 nonn
%O A297391 1,1
%A A297391 _R. H. Hardin_, Dec 29 2017