A228607 a(n) is the number of independent vertex subsets (i.e., the Merrifield-Simmons index) of the triangulane T[n] defined in the Khalifeh et al. and Deutsch et al. references.

54, 9450, 286679250, 263199759084281250, 221721055245240563933498289550781250, 157320497971930517299046640166039915248640240419548633694648742675781250

Offset: 1

Author

Emeric Deutsch, Dec 17 2013

Keywords

• nonn

References

• R. E. Merrifield, H. E. Simmons, Topological Methods in Chemistry, Wiley, New York, 1989. pp. 161-162.

Links

• Emeric Deutsch, Table of n, a(n) for n = 1..9
• E. Deutsch, S. Klavzar, Computing the Hosoya polynomial of graphs from primary subgraphs, MATCH Commun. Math. Comput. Chem., 70, 2013, 627-644.
• M. H. Khalifeh, H. Yousefi-Azari, A. R. Ashrafi, Computing Wiener and Kirchhoff indices of a triangulane, Indian J. Chemistry, 47A, 2008, 1503-1507.
• H. Prodinger and R. F. Tichy, Fibonacci numbers of graphs, Fibonacci Quarterly, 20, 1982, 16-21.
• Wikipedia, Triangulane

Programs

Maple

c[1] := 1: d[1] := 3: for n from 2 to 10 do c[n] := d[n-1]^2; d[n] := 2*c[n-1]*d[n-1]+d[n-1]^2 end do: seq(d[n]^3+3*c[n]*d[n]^2, n = 1 .. 7);

Formula

a(n) = d(n)^3 + 3*c(n)*d(n)^2, where c(1) = 1, d(1) = 3, c(n) = d(n-1)^2, d(n) = 2*c(n-1)*d(n-1) + d(n-1)^2 for n>=2.

If we replace the initial conditions for c and d by c[1] = x and d[1] = 1 + 2x, respectively, and the first equation by c[n] = x*d[n-1]^2, then a(n) will yield the independence polynomial of the triangulane T(n). For example, for n=2 one finds 1 + 21x + 180x^2 + 816x^3 + 2112x^4 + 3120x^5 + 2432x^6 + 768x^7 (checked with the Maple Graph Theory package).

d(n) = A338293(n+1). - R. J. Mathar, Jul 22 2022