login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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

%I

%S 19683,2099520,622080000,512000000000,175000000000000,

%T 117236328125000000,153936794281005859375,95375119619390625000000,

%U 97682483345284168128000000,165381614442044595841154678784

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

%C Diagonal of A250601

%H R. H. Hardin, <a href="/A250593/b250593.txt">Table of n, a(n) for n = 1..12</a>

%e Some solutions for n=1

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 25 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 19 23:51 EDT 2021. Contains 348095 sequences. (Running on oeis4.)