|
|
A304616
|
|
a(n) = 81*n^2 - 69*n + 24.
|
|
2
|
|
|
24, 36, 210, 546, 1044, 1704, 2526, 3510, 4656, 5964, 7434, 9066, 10860, 12816, 14934, 17214, 19656, 22260, 25026, 27954, 31044, 34296, 37710, 41286, 45024, 48924, 52986, 57210, 61596, 66144, 70854, 75726, 80760, 85956, 91314, 96834, 102516, 108360, 114366, 120534, 126864
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
For n>=1, a(n) = the first Zagreb index of the triangular silicate network TSL(n), defined pictorially in the Rosary et al. reference.
The first Zagreb index of a simple connected graph is the sum of the squared degrees of its vertices. Alternatively, it is the sum of the degree sums d(i) + d(j) over all edges ij of the graph.
The M-polynomial of TSL(n) is M(TSL(n); x,y) = 3*x^3*y^3 + 3*(3*n-1)*x^3*y^7 + 3*(n-1)*(n-2)*x^3*y^12 + 3*(n-1)*x^7*y^7 + 6(n-2)*x^7*y^12 + 3*(n-2)*(n-3)*x^12*y^12/2.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 6*(4 - 6*x + 29*x^2) / (1 - x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>2.
(End)
|
|
MAPLE
|
seq(81*n^2-69*n+24, n = 0 .. 40);
|
|
MATHEMATICA
|
Table[81n^2-69n+24, {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {24, 36, 210}, 50] (* Harvey P. Dale, Feb 03 2021 *)
|
|
PROG
|
(PARI) a(n) = 81*n^2 - 69*n + 24; \\ Altug Alkan, May 18 2018
(PARI) Vec(6*(4 - 6*x + 29*x^2) / (1 - x)^3 + O(x^40)) \\ Colin Barker, May 18 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|