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.

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

This page as a plain text file.
%I A207402 #8 Jun 22 2018 08:27:28
%S A207402 20,400,2340,8910,26676,68060,154580,321110,621300,1134296,1972900,
%T A207402 3293310,5306580,8291940,12612116,18730790,27232340,38844000,54460580,
%U A207402 75171886,102292980,137397420,182353620,239364470,311010356,400295720
%N A207402 Number of n X 7 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.
%C A207402 Column 7 of A207403.
%H A207402 R. H. Hardin, <a href="/A207402/b207402.txt">Table of n, a(n) for n = 1..210</a>
%F A207402 Empirical: a(n) = (1/36)*n^7 + (4/9)*n^6 + (53/18)*n^5 + (91/9)*n^4 + (589/36)*n^3 + (31/9)*n^2 - (58/3)*n + 6.
%F A207402 Conjectures from _Colin Barker_, Jun 22 2018: (Start)
%F A207402 G.f.: 2*x*(10 + 120*x - 150*x^2 + 135*x^3 - 42*x^4 - 14*x^5 + 14*x^6 - 3*x^7) / (1 - x)^8.
%F A207402 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 A207402 (End)
%e A207402 Some solutions for n=4:
%e A207402 ..0..0..0..0..0..0..0....0..1..0..1..0..0..0....1..1..1..1..1..1..1
%e A207402 ..1..1..1..0..0..0..0....0..1..0..1..0..0..0....0..1..0..1..0..0..0
%e A207402 ..0..0..0..0..0..0..0....0..1..0..1..0..0..0....1..1..1..1..1..1..1
%e A207402 ..1..0..0..0..0..0..0....0..1..0..1..0..0..0....0..1..0..1..0..0..0
%Y A207402 Cf. A207403.
%K A207402 nonn
%O A207402 1,1
%A A207402 _R. H. Hardin_, Feb 17 2012