This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A134489 a(n) = Fibonacci(5*n + 2). 2

%I

%S 1,13,144,1597,17711,196418,2178309,24157817,267914296,2971215073,

%T 32951280099,365435296162,4052739537881,44945570212853,

%U 498454011879264,5527939700884757,61305790721611591,679891637638612258

%N a(n) = Fibonacci(5*n + 2).

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

%F From _R. J. Mathar_, Jul 04 2011: (Start)

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

%F a(n) = 2*A049666(n) + A049666(n+1). (End)

%F a(n) = A000045(A016873(n)). - _Michel Marcus_, Nov 05 2013

%t Table[Fibonacci[5n + 2], {n, 0, 30}]

%o (MAGMA) [Fibonacci(5*n+2): n in [0..50]]; // _Vincenzo Librandi_, Apr 20 2011

%Y Cf. A000045, A001906, A001519, A033887, A015448, A014445, A033888-A033891, A102312, A099100, A134490-A134495, A103134, A134497-A134504.

%K nonn,easy

%O 0,2

%A _Artur Jasinski_, Oct 28 2007

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

Last modified August 18 20:02 EDT 2019. Contains 326109 sequences. (Running on oeis4.)