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”).

A086577
a(n) = 6*(10^n - 1).
8
0, 54, 594, 5994, 59994, 599994, 5999994, 59999994, 599999994, 5999999994, 59999999994, 599999999994, 5999999999994, 59999999999994, 599999999999994, 5999999999999994, 59999999999999994, 599999999999999994, 5999999999999999994, 59999999999999999994, 599999999999999999994
OFFSET
0,2
COMMENTS
Original definition: a(n) = k where R(k+6) = 6.
FORMULA
a(n) = 6*9*A002275(n) = 6*A002283(n).
R(a(n)) = A086576(n).
From Chai Wah Wu, Jul 08 2016: (Start)
a(n) = 11*a(n-1) - 10*a(n-2) for n > 1.
G.f.: 54*x/((1 - x)*(1 - 10*x)). (End)
E.g.f.: 6*exp(x)*(exp(9*x) - 1). - Elmo R. Oliveira, Sep 12 2024
MATHEMATICA
LinearRecurrence[{11, -10}, {0, 54}, 30] (* Harvey P. Dale, Nov 27 2022 *)
CROSSREFS
Cf. A002275, A004086 (R(n)).
One of a family of sequences of the form "Numbers k such that reverse(k+m) = m", m = 1 to 9; m=1: A002283, m=2: A086573, m=3: A086574, m=4: A086575, m=5: A086576, m=6: A086577, m=7: A086578, m=8: A086579, m=9: A086580.
Sequence in context: A245833 A254701 A376260 * A193152 A253006 A128961
KEYWORD
nonn,base,easy
AUTHOR
Ray Chandler, Jul 22 2003
EXTENSIONS
Name edited by Jinyuan Wang, Aug 04 2021
STATUS
approved