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.

A267786 Number of nX6 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.

This page as a plain text file.
%I A267786 #4 Jan 20 2016 12:29:44
%S A267786 51,2601,22110,211555,912667,4245574,13126812,42012357,106570618,
%T A267786 272337497,604928942,1330976409,2684633348,5309403837,9945849384,
%U A267786 18160668025,32072067434,55037496090,92610159756,151216855067
%N A267786 Number of nX6 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.
%C A267786 Column 6 of A267788.
%H A267786 R. H. Hardin, <a href="/A267786/b267786.txt">Table of n, a(n) for n = 1..210</a>
%F A267786 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 A267786 Some solutions for n=3
%e A267786 ..1..1..0..1..1..1....0..1..0..0..1..1....0..0..1..0..1..1....0..1..1..1..1..0
%e A267786 ..0..0..1..0..0..0....1..0..1..0..1..0....1..1..0..1..1..0....0..0..0..0..1..0
%e A267786 ..0..0..1..1..1..1....1..1..1..1..0..1....1..0..1..0..0..0....1..0..1..0..0..1
%Y A267786 Cf. A267788.
%K A267786 nonn
%O A267786 1,1
%A A267786 _R. H. Hardin_, Jan 20 2016