Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Hi all:

Sorry for my bad wordy title, my question is:

Input:

Given a m*n 4-connected grid of points each of which is labelled with an integer $\in\{1,...,k\}$. We say a label configuration z is feasible (k-connected-components partition) if points of the same label are connected on the grid and there are k different labels in total.

Output:

How many different feasible configuration are there?

Thanks for your help

E.E.

share|improve this question

1 Answer 1

Constraining m=n and k=2, this is http://oeis.org/A068416.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.