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!)
A188168 a(0) = a(1) = 1; a(n) = 5*a(n-1) + 5*a(n-2). 3

%I #8 Jun 14 2016 12:02:08

%S 1,1,10,55,325,1900,11125,65125,381250,2231875,13065625,76487500,

%T 447765625,2621265625,15345156250,89832109375,525886328125,

%U 3078592187500,18022392578125,105504923828125,617636582031250,3615707529296875,21166720556640625

%N a(0) = a(1) = 1; a(n) = 5*a(n-1) + 5*a(n-2).

%C First differences give {0,9,45,270,1575,9225,54000,316125,1850625,10833750,63421875,371278125, . . .}

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

%F G.f.: (4x-1)/(5x^2+5x-1)

%F a(n) = 1/5 2^-n (-(5-3 Sqrt[5])^n (2+Sqrt[5])+(-2+Sqrt[5]) (5+3 Sqrt[5])^n)

%t Transpose[NestList[Flatten[{Rest[#],ListCorrelate[{5,5},#]}]&, {1,1},40]][[1]]

%Y Cf. A123270.

%K nonn,easy

%O 0,3

%A _Harvey P. Dale_, Mar 23 2011

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 19:06 EDT 2024. Contains 371962 sequences. (Running on oeis4.)