login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167259 T(n,m) = Number of ways to partition an nXm grid into 3 connected equal-area regions. 0
0, 0, 0, 1, 0, 1, 0, 3, 3, 0, 0, 0, 10, 0, 0, 1, 0, 23, 23, 0, 1, 0, 9, 56, 0, 56, 9, 0, 0, 0, 132, 0, 0, 132, 0, 0, 1, 0, 259, 1787, 0, 1787, 259, 0, 1, 0, 19, 546, 0, 22889, 22889, 0, 546, 19, 0, 0, 0, 1095, 0, 0, 264500, 0, 0, 1095, 0, 0, 1, 0, 2043, 72105, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,8

LINKS

Table of n, a(n) for n=1..71.

CROSSREFS

Sequence in context: A180995 A144331 A216805 * A303650 A248625 A000876

Adjacent sequences:  A167256 A167257 A167258 * A167260 A167261 A167262

KEYWORD

nonn,tabl

AUTHOR

R. H. Hardin Oct 31 2009

STATUS

approved

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 November 21 01:23 EST 2019. Contains 329348 sequences. (Running on oeis4.)