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!)
A084135 a(n) = 10*a(n-1) - 15*a(n-2), a(0)=1, a(1)=5. 2
1, 5, 35, 275, 2225, 18125, 147875, 1206875, 9850625, 80403125, 656271875, 5356671875, 43722640625, 356876328125, 2912923671875, 23776091796875, 194067062890625, 1584029251953125, 12929286576171875, 105532426982421875 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Binomial transform of A084134.
LINKS
FORMULA
a(n) = (5+sqrt(10))^n/2 + (5-sqrt(10))^n/2.
G.f.: (1-5*x)/(1 - 10*x + 15*x^2).
E.g.f.: exp(5*x)*cosh(sqrt(10)*x).
MATHEMATICA
LinearRecurrence[{10, -15}, {1, 5}, 30] (* Harvey P. Dale, Oct 10 2012 *)
PROG
(PARI) a(n)=if(n<0, 0, polsym(x^2-10*x+15, n)[1+n]/2)
(Magma) [n le 2 select 5^(n-1) else 10*Self(n-1) -15*Self(n-2): n in [1..30]]; // G. C. Greubel, Oct 13 2022
(SageMath)
A084135=BinaryRecurrenceSequence(10, -15, 1, 5)
[A084135(n) for n in range(41)] # G. C. Greubel, Oct 13 2022
CROSSREFS
Cf. A084134.
Sequence in context: A180900 A344840 A087630 * A229111 A138233 A322666
KEYWORD
easy,nonn
AUTHOR
Paul Barry, May 16 2003
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 24 06:07 EDT 2024. Contains 371918 sequences. (Running on oeis4.)