Mathworld has something to say about the number of coloured graphs where no two colours may be adjacent (which is more restrictive than your problem). It suggest that using brute force to calculate the answer to your problem isn't viable.
In reply to Re: Pattern enumeration.
by JavaFan
in thread Pattern enumeration.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |