login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155199 a(n) = 10*a(n-1) + a(n-2), n > 2 ; a(0) = 1, a(1) = 9, a(2) = 90. 1

%I #24 Jan 03 2024 08:47:55

%S 1,9,90,909,9180,92709,936270,9455409,95490360,964359009,9739080450,

%T 98355163509,993290715540,10031262318909,101305913904630,

%U 1023090401365209,10332209927556720,104345189676932409,1053784106696880810,10642186256645740509,107475646673154285900

%N a(n) = 10*a(n-1) + a(n-2), n > 2 ; a(0) = 1, a(1) = 9, a(2) = 90.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (10,1).

%F G.f.: (1 - x - x^2)/(1 - 10*x - x^2).

%F a(n) = Sum_{k=0..n} A155161(n,k)*9^k. - _Philippe Deléham_, Feb 08 2012

%F E.g.f.: 1 + 9*exp(5*x)*sinh(sqrt(26)*x)/sqrt(26). - _Stefano Spezia_, Mar 01 2023

%t LinearRecurrence[{10,1},{1,9,90},20] (* _Harvey P. Dale_, Dec 20 2022 *)

%Y Cf. A001019, A155161.

%K nonn,easy

%O 0,2

%A _Philippe Deléham_, Jan 21 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)