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!)
A167260 T(n,m) = Number of ways to partition an nXm grid into 4 connected equal-area regions. 1

%I

%S 0,0,0,0,1,0,1,0,0,1,0,5,0,5,0,0,0,23,23,0,0,0,11,0,117,0,11,0,1,0,0,

%T 501,501,0,0,1,0,25,0,2369,0,2369,0,25,0,0,0,1038,9525,0,0,9525,1038,

%U 0,0,0,45,0,39731,0,442791,0,39731,0,45,0,1,0,0,145415,1596459,0,0,1596459

%N T(n,m) = Number of ways to partition an nXm grid into 4 connected equal-area regions.

%H R. H. Hardin, <a href="/A167260/b167260.txt">Table of n, a(n) for n=1..83</a>

%K nonn,tabl

%O 1,12

%A _R. H. Hardin_ Oct 31 2009

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 May 20 11:16 EDT 2022. Contains 353871 sequences. (Running on oeis4.)