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.

A367650 a(n) = 12345*10^n + 6789.

Original entry on oeis.org

19134, 130239, 1241289, 12351789, 123456789, 1234506789, 12345006789, 123450006789, 1234500006789, 12345000006789, 123450000006789, 1234500000006789, 12345000000006789, 123450000000006789, 1234500000000006789, 12345000000000006789, 123450000000000006789, 1234500000000000006789
Offset: 0

Views

Author

Stefano Spezia, Nov 25 2023

Keywords

Comments

For n > 3, a(n) satisfies (R(a(n)) - 1)/(a(n) + 1) = 8, where R(x) = A004086(x) is decimal digit reversal.

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{11,-10},{19134,130239},20]

Formula

a(n) = 11*a(n-1) - 10*a(n-2) for n > 1.
O.g.f.: 9*(2126 - 8915*x)/((1 - x)*(1 - 10*x)).
E.g.f.: 3*exp(x)*(2263 + 4115*exp(9*x)).