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.

A302942 a(n) = (2^n-1)^2*(2^n + 2).

Original entry on oeis.org

0, 4, 54, 490, 4050, 32674, 261954, 2096770, 16776450, 134216194, 1073738754, 8589928450, 68719464450, 549755789314, 4398046461954, 35184371990530, 281474976514050, 2251799813292034, 18014398508695554, 144115188074283010, 1152921504603701250, 9223372036848484354
Offset: 0

Views

Author

Eric W. Weisstein, Apr 16 2018

Keywords

Comments

a(n) is also the number of total dominating sets in the complete tripartite graph K_{n,n,n} for n > 0.

Crossrefs

Cf. A291703.

Programs

  • Mathematica
    Table[(2^n - 1)^2 (2^n + 2), {n, 0, 30}]
    LinearRecurrence[{11, -26, 16}, {4, 54, 490}, {0, 20}]
    CoefficientList[Series[-((2 x (2 + 5 x))/(-1 + 11 x - 26 x^2 + 16 x^3)), {x, 0, 20}], x]

Formula

a(n) = A291703(n) for n > 1.
a(n) = 11*a(n-1) - 26*a(n-2) + 16*a(n-3).
G.f.: -2*x*(2 + 5*x)/(-1 + 11*x - 26*x^2 + 16*x^3).
Showing 1-1 of 1 results.