The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A134503 a(n) = Fibonacci(7n + 5). 5

%I #21 Mar 11 2024 11:11:35

%S 5,144,4181,121393,3524578,102334155,2971215073,86267571272,

%T 2504730781961,72723460248141,2111485077978050,61305790721611591,

%U 1779979416004714189,51680708854858323072,1500520536206896083277

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

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

%F From _R. J. Mathar_, Apr 17 2011: (Start)

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

%F a(n) = 5*A049667(n+1) - A049667(n). (End)

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

%t LinearRecurrence[{29,1},{5,144},20] (* _Harvey P. Dale_, Apr 24 2017 *)

%o (Magma) [Fibonacci(7*n+5): n in [0..100]]; // _Vincenzo Librandi_, Apr 17 2011

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

%Y Cf. A000045, A134498, A134499, A134500, A134501, A134502, A134504.

%K nonn,easy

%O 0,1

%A _Artur Jasinski_, Oct 28 2007

%E Offset changed from 1 to 0 by _Vincenzo Librandi_, Apr 17 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 May 21 02:29 EDT 2024. Contains 372720 sequences. (Running on oeis4.)