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!)
A171513 1+8*10^n+100^n. 2

%I #7 Dec 15 2017 17:37:10

%S 10,181,10801,1008001,100080001,10000800001,1000008000001,

%T 100000080000001,10000000800000001,1000000008000000001,

%U 100000000080000000001,10000000000800000000001

%N 1+8*10^n+100^n.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (111,-1110,1000)

%F From _Chai Wah Wu_, May 30 2016: (Start)

%F a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 2.

%F G.f.: (1810*x^2 - 929*x + 10)/((1 - x)*(1 - 10*x)*(1 - 100*x)). (End)

%F E.g.f.: (1 + 8*exp(9*x) + exp(99*x))*exp(x). - _Ilya Gutkovskiy_, May 30 2016

%K easy,nonn

%O 0,1

%A _Jason Earls_, Dec 10 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 24 08:28 EDT 2024. Contains 371927 sequences. (Running on oeis4.)