|
| |
|
|
A225031
|
|
Non-crossing, non-nesting, 5-colored set partitions.
|
|
1
|
|
|
|
1, 6, 41, 321, 2846, 27961, 297681, 3371646, 40065361, 494281201, 6279901766, 81649478161, 1080910639201, 14511820543126, 196956264035481, 2695543342918241, 37127978351861646, 513895401953712521, 7139331902125917361, 99462520534916445006, 1388616983941077336321
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
|
|
|
FORMULA
|
G.f.: (1 -35*x +433*x^2 -2233*x^3 +4035*x^4 -x^5) / (1 -41*x +638*x^2 -4701*x^3 +16398*x^4 -21721*x^5 +x^6).
|
|
|
EXAMPLE
|
For n=2, a(2)=41 is the number of non-crossing, non-nesting set partitions on 3 elements with 5 possible arc colors.
|
|
|
MATHEMATICA
|
LinearRecurrence[{41, -638, 4701, -16398, 21721, -1}, {1, 6, 41, 321, 2846, 27961}, 21] (* Jean-François Alcover, Jul 22 2018 *)
|
|
|
PROG
|
(PARI) Vec((1 -35*x +433*x^2 -2233*x^3 +4035*x^4 -x^5) / (1 -41*x +638*x^2 -4701*x^3 +16398*x^4 -21721*x^5 +x^6) + O(x^66)) \\ Joerg Arndt, Apr 27 2013
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
