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.

A267717 Number of nX6 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 A267717 #4 Jan 19 2016 20:15:48
%S A267717 16,256,1080,4266,10489,26906,54887,114392,209470,385962,656670,
%T A267717 1114828,1796644,2877378,4446790,6818296,10190753,15108240,21972963,
%U A267717 31714408,45087635,63668368,88787667,123106970,168846792,230489608,311557126
%N A267717 Number of nX6 0..1 arrays with every repeated value in every row and column greater than the previous repeated value.
%C A267717 Column 6 of A267719.
%H A267717 R. H. Hardin, <a href="/A267717/b267717.txt">Table of n, a(n) for n = 1..210</a>
%F A267717 Empirical: a(n) = 2*a(n-1) +10*a(n-2) -22*a(n-3) -44*a(n-4) +110*a(n-5) +110*a(n-6) -330*a(n-7) -165*a(n-8) +660*a(n-9) +132*a(n-10) -924*a(n-11) +924*a(n-13) -132*a(n-14) -660*a(n-15) +165*a(n-16) +330*a(n-17) -110*a(n-18) -110*a(n-19) +44*a(n-20) +22*a(n-21) -10*a(n-22) -2*a(n-23) +a(n-24) for n>27
%e A267717 Some solutions for n=5
%e A267717 ..0..1..0..1..0..0....1..1..0..1..0..1....1..0..1..0..1..1....0..1..0..0..1..0
%e A267717 ..0..1..0..0..1..0....1..0..1..0..1..1....0..1..0..1..0..0....0..0..1..1..0..1
%e A267717 ..1..0..1..1..0..1....0..1..0..0..1..0....1..0..1..0..1..0....1..1..0..1..0..1
%e A267717 ..0..1..0..0..1..0....1..0..1..1..0..1....0..1..0..0..1..1....1..0..1..0..1..0
%e A267717 ..1..0..1..0..1..1....0..0..1..0..1..0....0..1..0..1..0..0....0..0..1..1..0..1
%Y A267717 Cf. A267719.
%K A267717 nonn
%O A267717 1,1
%A A267717 _R. H. Hardin_, Jan 19 2016