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

A024127
a(n) = 11^n-1.
10
0, 10, 120, 1330, 14640, 161050, 1771560, 19487170, 214358880, 2357947690, 25937424600, 285311670610, 3138428376720, 34522712143930, 379749833583240, 4177248169415650, 45949729863572160, 505447028499293770
OFFSET
0,2
COMMENTS
In base 11 these are 0, A, AA, AAA, ... - David Rabahy, Dec 12 2016
FORMULA
G.f.: 1/(1-11*x)-1/(1-x). - Mohammad K. Azarian, Jan 14 2009
E.g.f.: e^(11*x)-e^x. - Mohammad K. Azarian, Jan 14 2009
a(n) = 11*a(n-1)+10 for n>0, a(0)=0. - Vincenzo Librandi, Nov 19 2010
a(n) = Sum_{i=1..n} 10^i*binomial(n,n-i) for n>0, a(0)=0. - Bruno Berselli, Nov 11 2015
a(n) = A001020(n) - 1. - Sean A. Irvine, Jun 19 2019
MATHEMATICA
LinearRecurrence[{12, -11}, {0, 10}, 18] (* Ray Chandler, Aug 26 2015 *)
PROG
(PARI) a(n)=11^n-1 \\ Charles R Greathouse IV, Dec 12 2016
CROSSREFS
Cf. A001020.
Sequence in context: A300522 A252874 A182605 * A005949 A027568 A318495
KEYWORD
nonn,easy
AUTHOR
STATUS
approved