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

A016185
a(n) = 9^n - 8^n.
19
0, 1, 17, 217, 2465, 26281, 269297, 2685817, 26269505, 253202761, 2413042577, 22791125017, 213710059745, 1992110014441, 18478745943857, 170706760005817, 1571545212141185, 14425381885981321, 132080236787517137, 1206736529597136217, 11004743954450081825
OFFSET
0,3
COMMENTS
a(n) is also the number of n-digit numbers whose smallest decimal digit is 1. - Stefano Spezia, Nov 15 2023
FORMULA
G.f.: x/((1-8*x)*(1-9*x)).
E.g.f.: e^(9*x) - e^(8*x). - Mohammad K. Azarian, Jan 14 2009
a(n) = 9*a(n-1) + 8^(n-1), a(0)=0. - Vincenzo Librandi, Feb 09 2011
a(n) = 17*a(n-1) - 72*a(n-2), a(0)=0, a(1)=1. - Vincenzo Librandi, Feb 09 2011
a(n) = A001019(n) - A001018(n). - Alois P. Heinz, Aug 19 2021
MATHEMATICA
LinearRecurrence[{17, -72}, {0, 1}, 31] (* Vladimir Joseph Stephan Orlovsky, Feb 09 2011 *)
PROG
(Magma) [9^n -8^n: n in [0..40]]; // G. C. Greubel, Nov 29 2024
(Python)
def A016185(n): return pow(9, n) - pow(8, n)
print([A016185(n) for n in range(41)]) # G. C. Greubel, Nov 29 2024
CROSSREFS
KEYWORD
nonn,easy
STATUS
approved

  NODES
COMMUNITY 1
INTERN 1