|
|
A356761
|
|
a(n) = L(2*L(n)) + L(2*L(n+1)), where L(n) is the n-th Lucas number (A000032).
|
|
2
|
|
|
10, 21, 65, 890, 40446, 33424885, 1322190707485, 44140596372269298846, 58360810951947188228658239895890, 2576080923024092500207469693559464507701547824744865, 150342171745412969401059031474740559845525757221446054521410222913066501974929718621
(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/15 (Ohtsuka, 2022).
|
|
MATHEMATICA
|
a[n_] := LucasL[2*LucasL[n]] + LucasL[2*LucasL[n + 1]]; Array[a, 11, 0]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|