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.

A020523 a(n) = 3rd Euler polynomial evaluated at 2^n and multiplied by 4.

Original entry on oeis.org

-1, 9, 161, 1665, 14849, 124929, 1024001, 8290305, 66715649, 535298049, 4288675841, 34334572545, 274777243649, 2198620602369, 17590575431681, 140731045904385, 1125874137038849, 9007096175525889, 72057181721067521, 576459103035981825, 4611679421357621249, 36893461759140036609
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

Formula

a(n) = 4*8^n - 6*4^n + 1.
From Colin Barker, May 04 2015: (Start)
a(n) = 13*a(n-1) - 44*a(n-2) + 32*a(n-3) for n > 2.
G.f.: -(22*x-1)/((x-1)*(4*x-1)*(8*x-1)). (End)
E.g.f.: exp(x)*(4*exp(7*x) - 6*exp(3*x) + 1). - Elmo R. Oliveira, Feb 23 2025