login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134490 a(n) = Fibonacci(5n + 3). 11
2, 21, 233, 2584, 28657, 317811, 3524578, 39088169, 433494437, 4807526976, 53316291173, 591286729879, 6557470319842, 72723460248141, 806515533049393, 8944394323791464, 99194853094755497, 1100087778366101931 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..17.

Index entries for linear recurrences with constant coefficients, signature (11,1)

FORMULA

a(n) = 11a(n-1) + a(n-2). - Paul Curtz, May 07 2008

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

From R. J. Mathar, Nov 02 2008: (Start)

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

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

a(n) = A000045(A016885(n)). - Michel Marcus, Nov 08 2013

MATHEMATICA

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

PROG

(MAGMA) [Fibonacci(5*n+3): n in [0..100]]; // Vincenzo Librandi, Apr 16 2011

(PARI) a(n)=fibonacci(5*n+3) \\ Charles R Greathouse IV, Jun 11 2015

CROSSREFS

Cf. A000045, A102312, A099100, A134491.

Sequence in context: A024231 A069717 A036679 * A045726 A105712 A087677

Adjacent sequences:  A134487 A134488 A134489 * A134491 A134492 A134493

KEYWORD

nonn,easy

AUTHOR

Artur Jasinski, Oct 28 2007

EXTENSIONS

Offset changed to 0 by R. J. Mathar, Jul 28 2008

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 07:15 EDT 2019. Contains 324203 sequences. (Running on oeis4.)