login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A367650
a(n) = 12345*10^n + 6789.
2
19134, 130239, 1241289, 12351789, 123456789, 1234506789, 12345006789, 123450006789, 1234500006789, 12345000006789, 123450000006789, 1234500000006789, 12345000000006789, 123450000000006789, 1234500000000006789, 12345000000000006789, 123450000000000006789, 1234500000000000006789
OFFSET
0,1
COMMENTS
For n > 3, a(n) satisfies (R(a(n)) - 1)/(a(n) + 1) = 8, where R(x) = A004086(x) is decimal digit reversal.
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)).
MATHEMATICA
LinearRecurrence[{11, -10}, {19134, 130239}, 20]
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Stefano Spezia, Nov 25 2023
STATUS
approved