|
|
A228597
|
|
The Wiener index of the graph obtained by applying Mycielski's construction to a benzenoid consisting of a linear chain of n hexagons.
|
|
1
|
|
|
141, 445, 941, 1629, 2509, 3581, 4845, 6301, 7949, 9789, 11821, 14045, 16461, 19069, 21869, 24861, 28045, 31421, 34989, 38749, 42701, 46845, 51181, 55709, 60429, 65341, 70445, 75741, 81229, 86909, 92781, 98845, 105101, 111549, 118189
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
D. B. West, Introduction to Graph Theory, 2nd ed., Prentice-Hall, NJ, 2001, p. 205.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 96*n^2 + 16*n + 29.
G.f.: x*(141+22*x+29*x^2)/(1-x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - G. C. Greubel, Dec 08 2016
|
|
MAPLE
|
a := proc (n) options operator, arrow: 96*n^2+16*n+29 end proc: seq(a(n), n = 1 .. 35);
|
|
MATHEMATICA
|
LinearRecurrence[{3, -3, 1}, {141, 445, 941}, 100] (* or *) Table[96*n^2 + 16*n + 29 , {n, 1, 100}] (* G. C. Greubel, Dec 08 2016 *)
|
|
PROG
|
(PARI) Vec(x*(141+22*x+29*x^2)/(1-x)^3 + O(x^50)) \\ G. C. Greubel, Dec 08 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|