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

%I #4 Mar 31 2012 12:35:36

%S 0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,41,0,0,

%T 41,0,0,1,0,0,0,0,0,0,0,1,0,55,0,0,0,0,0,0,55,0,0,0,3127,0,0,178939,0,

%U 0,3127,0,0,0,0,0,179399,0,0,0,0,179399,0,0,0,0,0,0,0,13205354,0,0,0,13205354,0

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

%H R. H. Hardin, <a href="/A167265/b167265.txt">Table of n, a(n) for n=1..127</a>

%K nonn,tabl

%O 1,31

%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 March 28 08:22 EDT 2024. Contains 371236 sequences. (Running on oeis4.)