This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A134490 a(n) = Fibonacci(5n + 3). 11

%I

%S 2,21,233,2584,28657,317811,3524578,39088169,433494437,4807526976,

%T 53316291173,591286729879,6557470319842,72723460248141,

%U 806515533049393,8944394323791464,99194853094755497,1100087778366101931

%N a(n) = Fibonacci(5n + 3).

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

%F a(n) = 11a(n-1) + a(n-2). - _Paul Curtz_, May 07 2008

%F a(n) = -(2/5)*(11/2 - (5/2)*sqrt(5))^n*sqrt(5) + (11/2 - (5/2)*sqrt(5))^n + (2/5)*sqrt(5)*(11/2 + (5/2)*sqrt(5))^n + (11/2 + (5/2)*sqrt(5))^n. - _Paolo P. Lava_, Oct 03 2008

%F From _R. J. Mathar_, Nov 02 2008: (Start)

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

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

%F a(n) = A000045(A016885(n)). - _Michel Marcus_, Nov 08 2013

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

%o (MAGMA) [Fibonacci(5*n+3): n in [0..100]]; // _Vincenzo Librandi_, Apr 16 2011

%o (PARI) a(n)=fibonacci(5*n+3) \\ _Charles R Greathouse IV_, Jun 11 2015

%Y Cf. A000045, A102312, A099100, A134491.

%K nonn,easy

%O 0,1

%A _Artur Jasinski_, Oct 28 2007

%E Offset changed to 0 by _R. J. Mathar_, Jul 28 2008

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 July 17 02:50 EDT 2019. Contains 325092 sequences. (Running on oeis4.)