|
|
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).
|
|
2
|
|
|
5, 6, 10, 25, 141, 2330, 273650, 599346021, 162615199748425, 97418273437938007563970, 15841633607002514292104722681296528726, 1543264591854508694059707631430587191184612139118583889182925
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
Hideyuki Ohtsuka, Problem H-901, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 60, No. 3 (2022), p. 281.
|
|
FORMULA
|
Sum_{n>=0} (-1)^n/a(n) = 1/10 (Ohtsuka, 2022).
|
|
MATHEMATICA
|
a[n_] := LucasL[2*Fibonacci[n]] + LucasL[2*Fibonacci[n + 1]]; Array[a, 12, 0]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|