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.

A190543 a(n) = 8^n - 3^n.

Original entry on oeis.org

0, 5, 55, 485, 4015, 32525, 261415, 2094965, 16770655, 134198045, 1073682775, 8589757445, 68718945295, 549754219565, 4398041728135, 35184357739925, 281474933663935, 2251799684545085, 18014398122061495, 144115186913594405, 1152921501120062575, 9223372026394422605
Offset: 0

Views

Author

Vincenzo Librandi, Jun 02 2011

Keywords

Comments

Length-n words from letters {1, 2, ..., 8} with at least one letter greater than 3. - Joerg Arndt, Jun 02 2011
All terms are odd multiples of 5, since the powers of 8 mod 10 are 8, 4, 2, 6, ... and the powers of 3 mod 10 are 3, 9, 7, 1, ... - Alonso del Arte, Feb 25 2014

Crossrefs

Programs

Formula

a(n) = 11*a(n-1) - 24*a(n-2).
a(n) = A001018(n) - A000244(n). - Michel Marcus, Feb 26 2014
From Vincenzo Librandi, Oct 05 2014: (Start)
G.f.: 5*x/((1-3*x)*(1-8*x)).
a(n+1) = 5*A016140(n). (End)
E.g.f.: 2*exp(11*x/2)*sinh(5*x/2). - Elmo R. Oliveira, Mar 31 2025