cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A074528 a(n) = 2^n + 3^n + 6^n.

Original entry on oeis.org

3, 11, 49, 251, 1393, 8051, 47449, 282251, 1686433, 10097891, 60526249, 362976251, 2177317873, 13062296531, 78368963449, 470199366251, 2821153019713, 16926788715971, 101560344351049, 609360902796251
Offset: 0

Views

Author

Robert G. Wilson v, Aug 23 2002

Keywords

Comments

From Álvar Ibeas, Mar 24 2015: (Start)
Number of isomorphism classes of 3-fold coverings of a connected graph with circuit rank n+1 [Kwak and Lee].
Number of orbits of the conjugacy action of Sym(3) on Sym(3)^(n+1) [Kwak and Lee, 2001].
(End)

References

  • J. H. Kwak and J. Lee, Enumeration of graph coverings, surface branched coverings and related group theory, in Combinatorial and Computational Mathematics (Pohang, 2000), ed. S. Hong et al., World Scientific, Singapore 2001, pp. 97-161. [Added by N. J. A. Sloane, Nov 12 2009]

Crossrefs

A246985 is essentially identical.
Third row of A160449, shifted.

Programs

Formula

From Mohammad K. Azarian, Dec 26 2008: (Start)
G.f.: 1/(1-2*x)+1/(1-3*x)+1/(1-6*x).
E.g.f.: exp(2*x) + exp(3*x) + exp(6*x). (End)
a(n) = 11*a(n-1) - 36*a(n-2) + 36*a(n-3). - Wesley Ivan Hurt, Aug 21 2020
Showing 1-1 of 1 results.