|
|
A309315
|
|
Number of 5-colorings of an n-wheel graph.
|
|
3
|
|
|
60, 120, 420, 1200, 3660, 10920, 32820, 98400, 295260, 885720, 2657220, 7971600, 23914860, 71744520, 215233620, 645700800, 1937102460, 5811307320, 17433922020, 52301766000, 156905298060, 470715894120, 1412147682420, 4236443047200, 12709329141660
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
|
|
LINKS
|
Prateek Bhakta, Benjamin Brett Buckner, Lauren Farquhar, Vikram Kamat, Sara Krehbiel, Heather M. Russell, Cut-Colorings in Coloring Graphs, Graphs and Combinatorics, (2019) 35(1), 239-248.
|
|
FORMULA
|
a(n) = 5*3^(n-1)-15*(-1)^n.
G.f.: 60*x^3 / ((1 + x)*(1 - 3*x)).
a(n) = 2*a(n-1) + 3*a(n-2) for n>4.
(End)
|
|
PROG
|
(PARI) Vec(60*x^3 / ((1 + x)*(1 - 3*x)) + O(x^30)) \\ Colin Barker, Jul 24 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|