cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A103134 a(n) = Fibonacci(6n+4).

Original entry on oeis.org

3, 55, 987, 17711, 317811, 5702887, 102334155, 1836311903, 32951280099, 591286729879, 10610209857723, 190392490709135, 3416454622906707, 61305790721611591, 1100087778366101931, 19740274219868223167, 354224848179261915075, 6356306993006846248183
Offset: 0

Views

Author

Creighton Dement, Jan 24 2005

Keywords

Comments

Gives those numbers which are Fibonacci numbers in A103135.
Generally, for any sequence where a(0)= Fibonacci(p), a(1) = F(p+q) and Lucas(q)*a(1) +- a(0) = F(p+2q), then a(n) = L(q)*a(n-1) +- a(n-2) generates the following Fibonacci sequence: a(n) = F(q(n)+p). So for this sequence, a(n) = 18*a(n-1) - a(n-2) = F(6n+4): q=6, because 18 is the 6th Lucas number (L(0) = 2, L(1)=1); F(4)=3, F(10)=55 and F(16)=987 (F(0)=0 and F(1)=1). See Lucas sequence A000032. This is a special case where a(0) and a(1) are increasing Fibonacci numbers and Lucas(m)*a(1) +- a(0) is another Fibonacci. - Bob Selcoe, Jul 08 2013
a(n) = x + y where x and y are solutions to x^2 = 5*y^2 - 1. (See related sequences with formula below.) - Richard R. Forberg, Sep 05 2013

Crossrefs

Programs

Formula

G.f.: (x+3)/(x^2-18*x+1).
a(n) = 18*a(n-1) - a(n-2) for n>1; a(0)=3, a(1)=55. - Philippe Deléham, Nov 17 2008
a(n) = A007805(n) + A075796(n), as follows from comment above. - Richard R. Forberg, Sep 05 2013
a(n) = ((15-7*sqrt(5)+(9+4*sqrt(5))^(2*n)*(15+7*sqrt(5))))/(10*(9+4*sqrt(5))^n). - Colin Barker, Jan 24 2016
a(n) = S(3*n+1, 3) = 3*S(n,18) + S(n-1,18), with the Chebyshev S polynomials (A049310), S(-1, x) = 0, and S(n, 18) = A049660(n+1). - Wolfdieter Lang, May 08 2023

Extensions

Edited by N. J. A. Sloane, Aug 10 2010