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.

A050914 a(n) = n*3^n + 1.

Original entry on oeis.org

1, 4, 19, 82, 325, 1216, 4375, 15310, 52489, 177148, 590491, 1948618, 6377293, 20726200, 66961567, 215233606, 688747537, 2195382772, 6973568803, 22082967874, 69735688021, 219667417264, 690383311399, 2165293113022, 6778308875545, 21182215236076, 66088511536555, 205891132094650
Offset: 0

Views

Author

N. J. A. Sloane, Dec 30 1999

Keywords

Crossrefs

Equals A036290(n) + 1.

Programs

Formula

From Colin Barker, Oct 14 2012: (Start)
a(n) = 7*a(n-1) - 15*a(n-2) + 9*a(n-3).
G.f.: -(6*x^2 - 3*x + 1)/((x-1)*(3*x-1)^2). (End)
E.g.f.: exp(x)*(3*x*exp(2*x) + 1). - Elmo R. Oliveira, Sep 09 2024