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.

A208141 Number of n X 7 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.

This page as a plain text file.
%I A208141 #8 Jun 28 2018 14:35:57
%S A208141 20,400,3000,14000,49000,141120,352800,792000,1633500,3146000,5725720,
%T A208141 9937200,16562000,26656000,41616000,63256320,93896100,136458000,
%U A208141 194579000,272734000,376372920,512072000,687700000,912600000,1197787500
%N A208141 Number of n X 7 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.
%C A208141 Column 7 of A208142.
%H A208141 R. H. Hardin, <a href="/A208141/b208141.txt">Table of n, a(n) for n = 1..210</a>
%F A208141 Empirical: a(n) = (5/36)*n^7 + (5/4)*n^6 + (155/36)*n^5 + (85/12)*n^4 + (50/9)*n^3 + (5/3)*n^2.
%F A208141 Conjectures from _Colin Barker_, Jun 28 2018: (Start)
%F A208141 G.f.: 20*x*(1 + 12*x + 18*x^2 + 4*x^3) / (1 - x)^8.
%F A208141 a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8) for n>8.
%F A208141 (End)
%e A208141 Some solutions for n=4:
%e A208141 ..0..1..0..1..0..0..0....1..1..0..1..0..1..0....0..0..0..0..0..0..0
%e A208141 ..1..0..0..0..0..0..0....1..1..0..1..0..1..0....1..1..1..0..0..0..0
%e A208141 ..0..0..0..0..0..0..0....0..1..0..0..0..0..0....0..0..0..0..0..0..0
%e A208141 ..0..0..0..0..0..0..0....0..1..0..0..0..0..0....0..0..0..0..0..0..0
%Y A208141 Cf. A208142.
%K A208141 nonn
%O A208141 1,1
%A A208141 _R. H. Hardin_, Feb 23 2012