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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099100 Fibonacci(5n+1). 11
1, 8, 89, 987, 10946, 121393, 1346269, 14930352, 165580141, 1836311903, 20365011074, 225851433717, 2504730781961, 27777890035288, 308061521170129, 3416454622906707, 37889062373143906, 420196140727489673, 4660046610375530309, 51680708854858323072, 573147844013817084101, 6356306993006846248183 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

Tanya Khovanova, Recursive Sequences

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

FORMULA

G.f.: (1-3x)/(1-11x-x^2); a(n) = 11*a(n-1)+a(n-2); a(n) = sum{k=0..5n, binomial(k, 5n-k)}.

a(n) = -(1/10)*[(11/2)-(5/2)*sqrt(5)]^n*sqrt(5)+(1/2)*[(11/2)-(5/2)*sqrt(5)]^n+(1/10)*sqrt(5)*[(11/2)+(5 /2)*sqrt(5)]^n+(1/2)*[(11/2)+(5/2)*sqrt(5)]^n, with n>=0. - Paolo P. Lava, Nov 19 2008

MAPLE

with(combinat): A099100:=n->fibonacci(5*n+1): seq(A099100(n), n=0..20); # Wesley Ivan Hurt, Nov 18 2014

MATHEMATICA

Fibonacci/@(5*Range[0, 30]+1) (* Vladimir Joseph Stephan Orlovsky, Mar 01 2010 *)

PROG

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

(PARI) a(n)=fibonacci(5*n+1) \\ Charles R Greathouse IV, Sep 28 2015

CROSSREFS

Cf. A000045.

Sequence in context: A061000 A240457 A072352 * A208265 A184756 A264072

Adjacent sequences:  A099097 A099098 A099099 * A099101 A099102 A099103

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Sep 29 2004

EXTENSIONS

Corrected second formula. - Philippe Deléham, Nov 16 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 28 05:58 EDT 2017. Contains 288813 sequences.