login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A183418 Number of nX5 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j 1

%I #5 Mar 31 2012 12:35:51

%S 96,15232,2748326,535504390,108917015732,22819790947743,

%T 4882354760830113,1061262556019472565,233540084105702534983,

%U 51902083367733896338751,11628306862159911222856791,2622857292112189173922446856

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

%C Column 5 of A183419

%H R. H. Hardin, <a href="/A183418/b183418.txt">Table of n, a(n) for n = 1..16</a>

%e Some solutions for 4X5

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

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

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

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

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:41 EDT 2024. Contains 371906 sequences. (Running on oeis4.)