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.

User: Hexuan Wang

Hexuan Wang's wiki page.

Hexuan Wang has authored 1 sequences.

A344684 Sum of two consecutive products of Fibonacci and Pell numbers: F(n)*P(n) + F(n+1)*P(n+1).

Original entry on oeis.org

1, 3, 12, 46, 181, 705, 2757, 10765, 42058, 164280, 641739, 2506789, 9792253, 38251227, 149420064, 583676434, 2280003517, 8906330973, 34790619369, 135901886149, 530870766310
Offset: 0

Views

Author

Greg Dresden and Hexuan Wang, Aug 17 2021

Keywords

Comments

a(n) is the numerator of the continued fraction [1,...,1,2,...,2] with n 1's followed by n 2's.

Examples

			For n=3, a(3)=46 which is F(3)*P(3) + F(4)*P(4) = 2*5 + 3*12 = 46. Also, the continued fraction [1,1,1,2,2,2] with 3 1's followed by 3 2's has numerator 46.

Links

Crossrefs

Cf. A000045, A000129, A001582.

Programs

  • Mathematica
    Table[Fibonacci[n] Fibonacci[n, 2] + Fibonacci[n + 1] Fibonacci[n + 1, 2], {n, 0, 30}]
  • PARI
    P(n) = ([2, 1; 1, 0]^n)[2, 1]; \\ A000129
a(n) = fibonacci(n)*P(n)+ fibonacci(n+1)*P(n+1); \\ Michel Marcus, Aug 18 2021

Formula

a(n) = F(n)*P(n) + F(n+1)*P(n+1) for F(n) = A000045(n) the Fibonacci numbers and P(n) = A000129(n) the Pell numbers.
a(n) = 2*a(n-1) + 7*a(n-2) + 2*a(n-3) - a(n-4).
G.f.: (1 + x - x^2 - x^3)/(1 - 2*x - 7*x^2 - 2*x^3 + x^4).
a(n) = A001582(n-1) + A001582(n) for n >= 1.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.