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.

A267785 Number of nX5 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 A267785 #4 Jan 20 2016 12:29:01
%S A267785 28,784,5004,34173,122770,460598,1234716,3380133,7591852,17155354,
%T A267785 34199992,67950531,124234066,225071767,385178280,650960709,1057141184,
%U A267785 1692165611,2633057784,4034703001,6058479774,8956146100,13048584888
%N A267785 Number of nX5 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 A267785 Column 5 of A267788.
%H A267785 R. H. Hardin, <a href="/A267785/b267785.txt">Table of n, a(n) for n = 1..210</a>
%F A267785 Empirical: a(n) = 2*a(n-1) +8*a(n-2) -18*a(n-3) -27*a(n-4) +72*a(n-5) +48*a(n-6) -168*a(n-7) -42*a(n-8) +252*a(n-9) -252*a(n-11) +42*a(n-12) +168*a(n-13) -48*a(n-14) -72*a(n-15) +27*a(n-16) +18*a(n-17) -8*a(n-18) -2*a(n-19) +a(n-20) for n>22
%e A267785 Some solutions for n=4
%e A267785 ..1..0..0..1..0....0..1..0..0..1....1..0..0..0..1....0..0..1..0..0
%e A267785 ..0..1..1..0..1....0..0..0..0..1....0..0..1..1..1....1..1..0..1..1
%e A267785 ..1..0..0..0..0....1..0..1..1..0....0..1..0..0..0....1..1..1..1..0
%e A267785 ..0..1..0..1..0....1..1..1..1..1....1..1..1..1..1....0..0..0..0..0
%Y A267785 Cf. A267788.
%K A267785 nonn
%O A267785 1,1
%A A267785 _R. H. Hardin_, Jan 20 2016