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.

A207455 Number of 4 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically.

This page as a plain text file.
%I A207455 #13 Sep 04 2022 10:55:37
%S A207455 8,64,168,760,2560,10088,36456,138176,509960,1910296,7096320,26485576,
%T A207455 98590024,367542080,1369032168,5101852856,19007490560,70825236904,
%U A207455 263884411560,983242576576,3663494987848,13650146856152,50859864760320
%N A207455 Number of 4 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically.
%C A207455 Row 4 of A207453.
%H A207455 R. H. Hardin, <a href="/A207455/b207455.txt">Table of n, a(n) for n = 1..210</a>
%F A207455 Empirical: a(n) = a(n-1) + 10*a(n-2) + 3*a(n-3) - 9*a(n-4).
%F A207455 Empirical g.f.: 8*x*(1 + 7*x + 3*x^2 - 9*x^3) / (1 - x - 10*x^2 - 3*x^3 + 9*x^4). - _Colin Barker_, Jun 23 2018
%e A207455 Some solutions for n=5:
%e A207455   1 0 1 1 1     1 0 1 1 0     0 1 0 1 0     0 1 0 1 1
%e A207455   1 1 1 1 1     0 1 0 1 0     1 1 1 1 0     0 1 1 1 1
%e A207455   1 1 1 1 1     0 1 0 1 0     0 1 0 1 0     0 1 0 1 0
%e A207455   0 1 1 1 1     0 1 0 1 0     0 1 0 1 0     0 1 0 1 0
%Y A207455 Cf. A207453.
%K A207455 nonn
%O A207455 1,1
%A A207455 _R. H. Hardin_, Feb 17 2012