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!)
A183415 Number of nX2 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j 1

%I

%S 5,34,249,1920,15232,123323,1012996,8413325,70482133,594587235,

%T 5044756083,43007895169,368151018388,3162466934006,27248906449457,

%U 235414313839524,2038652180610193,17691623325368274,153819626587560407

%N Number of nX2 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j

%C Column 2 of A183419

%H R. H. Hardin, <a href="/A183415/b183415.txt">Table of n, a(n) for n = 1..200</a>

%e Some solutions for 4X2

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 04 2011

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 May 28 21:37 EDT 2020. Contains 334690 sequences. (Running on oeis4.)