login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A251186 Number of (n+2)X(n+2) 0..1 arrays with nondecreasing sum of every three consecutive values in every row and column 1

%I

%S 512,7776,209952,10077696,259200000,9600000000,512000000000,

%T 16807000000000,720600125000000,40353607000000000,1525017689435520000,

%U 71151225318303621120,4098310578334288576512,169762607240564688666624

%N Number of (n+2)X(n+2) 0..1 arrays with nondecreasing sum of every three consecutive values in every row and column

%C Diagonal of A251192

%H R. H. Hardin, <a href="/A251186/b251186.txt">Table of n, a(n) for n = 1..20</a>

%e Some solutions for n=2

%e ..0..0..1..1....0..1..0..0....0..0..0..0....0..1..1..1....0..0..0..0

%e ..1..0..1..1....1..1..1..1....0..1..1..1....1..0..0..1....0..1..0..0

%e ..0..0..0..0....0..0..1..0....0..0..0..0....0..1..1..1....0..0..0..1

%e ..0..1..1..1....1..1..0..1....0..1..0..1....1..1..1..1....0..0..0..1

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 30 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 04:09 EDT 2019. Contains 328106 sequences. (Running on oeis4.)