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.

A267718 Number of nX7 0..1 arrays with every repeated value in every row and column greater than the previous repeated value.

This page as a plain text file.
%I A267718 #4 Jan 19 2016 20:16:29
%S A267718 20,400,1866,7879,20226,54887,116036,255009,481390,932245,1627470,
%T A267718 2893983,4765598,7967260,12535320,20000374,30337594,46665892,68699820,
%U A267718 102616722,147369478,214889742,302259706,431988823,597033836,838908027
%N A267718 Number of nX7 0..1 arrays with every repeated value in every row and column greater than the previous repeated value.
%C A267718 Column 7 of A267719.
%H A267718 R. H. Hardin, <a href="/A267718/b267718.txt">Table of n, a(n) for n = 1..210</a>
%F A267718 Empirical: a(n) = 2*a(n-1) +12*a(n-2) -26*a(n-3) -65*a(n-4) +156*a(n-5) +208*a(n-6) -572*a(n-7) -429*a(n-8) +1430*a(n-9) +572*a(n-10) -2574*a(n-11) -429*a(n-12) +3432*a(n-13) -3432*a(n-15) +429*a(n-16) +2574*a(n-17) -572*a(n-18) -1430*a(n-19) +429*a(n-20) +572*a(n-21) -208*a(n-22) -156*a(n-23) +65*a(n-24) +26*a(n-25) -12*a(n-26) -2*a(n-27) +a(n-28) for n>30
%e A267718 Some solutions for n=5
%e A267718 ..0..0..1..0..1..0..1....0..1..0..1..0..1..1....1..0..1..0..1..0..0
%e A267718 ..1..1..0..1..0..1..0....1..1..0..1..0..1..0....0..1..0..1..0..1..0
%e A267718 ..1..0..1..0..1..0..1....0..0..1..0..1..0..1....1..0..1..0..1..0..1
%e A267718 ..0..0..1..1..0..1..0....0..1..0..1..0..1..0....0..1..0..0..1..1..0
%e A267718 ..1..1..0..1..0..1..0....1..0..1..0..1..0..0....0..1..0..1..0..1..1
%Y A267718 Cf. A267719.
%K A267718 nonn
%O A267718 1,1
%A A267718 _R. H. Hardin_, Jan 19 2016