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!)
A171375 1+3*10^n+100^n. 2
5, 131, 10301, 1003001, 100030001, 10000300001, 1000003000001, 100000030000001, 10000000300000001, 1000000003000000001, 100000000030000000001, 10000000000300000000001, 1000000000003000000000001, 100000000000030000000000001, 10000000000000300000000000001 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
From Chai Wah Wu, May 30 2016: (Start)
a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 2.
G.f.: (1310*x^2 - 424*x + 5)/((1 - x)*(1 - 10*x)*(1 - 100*x)). (End)
E.g.f.: (1 + 3*exp(9*x) + exp(99*x))*exp(x). - Ilya Gutkovskiy, May 30 2016
MATHEMATICA
LinearRecurrence[{111, -1110, 1000}, {5, 131, 10301}, 20] (* Harvey P. Dale, Jun 03 2016 *)
CROSSREFS
Sequence in context: A145611 A222880 A070247 * A191409 A003372 A187357
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Dec 07 2009
EXTENSIONS
More terms from Harvey P. Dale, Jun 03 2016
STATUS
approved

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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)