A356760 - cp's OEIS frontend

A356760 a(n) = L(2F(n)) + L(2F(n+1)), where L(n) is the n-th Lucas number (A000032), and F(n) is the n-th Fibonacci number (A000045).

n	a(n)
0	5
1	6
2	10
3	25
4	141
5	2330
6	273650
7	599346021
8	162615199748425
9	97418273437938007563970
10	15841633607002514292104722681296528726
11	1543264591854508694059707631430587191184612139118583889182925

[5, 6, 10, 25, 141, 2330, 273650, 599346021, 162615199748425, 97418273437938007563970, 15841633607002514292104722681296528726, 1543264591854508694059707631430587191184612139118583889182925]

cp's OEIS Frontend

A356760 a(n) = L(2F(n)) + L(2F(n+1)), where L(n) is the n-th Lucas number (A000032), and F(n) is the n-th Fibonacci number (A000045).

Table of values

List of values

cp's OEIS Frontend

A356760 a(n) = L(2*F(n)) + L(2*F(n+1)), where L(n) is the n-th Lucas number (A000032), and F(n) is the n-th Fibonacci number (A000045).

Table of values

List of values

A356760 a(n) = L(2F(n)) + L(2F(n+1)), where L(n) is the n-th Lucas number (A000032), and F(n) is the n-th Fibonacci number (A000045).