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.

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

This page as a plain text file.
%I A208375 #9 Jul 02 2018 05:45:47
%S A208375 10,100,240,420,640,900,1200,1540,1920,2340,2800,3300,3840,4420,5040,
%T A208375 5700,6400,7140,7920,8740,9600,10500,11440,12420,13440,14500,15600,
%U A208375 16740,17920,19140,20400,21700,23040,24420,25840,27300,28800,30340,31920,33540
%N A208375 Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.
%C A208375 Column 4 of A208379.
%H A208375 R. H. Hardin, <a href="/A208375/b208375.txt">Table of n, a(n) for n = 1..210</a>
%F A208375 Empirical: a(n) = 20*n^2 + 40*n - 60 for n>1.
%F A208375 Conjectures from _Colin Barker_, Jul 02 2018: (Start)
%F A208375 G.f.: 10*x*(1 + 7*x - 3*x^2 - x^3) / (1 - x)^3.
%F A208375 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>4.
%F A208375 (End)
%e A208375 Some solutions for n=4:
%e A208375 ..1..1..0..1....1..0..1..1....0..0..1..1....1..1..0..1....1..1..0..1
%e A208375 ..1..1..0..1....1..0..0..1....0..0..1..1....1..1..0..1....1..0..0..1
%e A208375 ..1..1..0..1....1..0..0..1....0..0..1..1....0..1..0..0....1..0..0..1
%e A208375 ..0..1..0..1....1..0..0..1....0..0..1..0....0..1..0..0....1..0..0..1
%Y A208375 Cf. A208379.
%K A208375 nonn
%O A208375 1,1
%A A208375 _R. H. Hardin_, Feb 25 2012