|
%I #11 Oct 16 2023 01:51:06
%S 10,21,65,890,40446,33424885,1322190707485,44140596372269298846,
%T 58360810951947188228658239895890,
%U 2576080923024092500207469693559464507701547824744865,150342171745412969401059031474740559845525757221446054521410222913066501974929718621
%N a(n) = L(2*L(n)) + L(2*L(n+1)), where L(n) is the n-th Lucas number (A000032).
%H Amiram Eldar, <a href="/A356761/b356761.txt">Table of n, a(n) for n = 0..15</a>
%H Hideyuki Ohtsuka, <a href="https://www.fq.math.ca/Problems/AdvProbAug2022.pdf">Problem H-901</a>, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 60, No. 3 (2022), p. 281.
%F a(n) = A000032(2*A000032(n)) + A000032(2*A000032(n+1)).
%F Sum_{n>=0} (-1)^n/a(n) = 1/15 (Ohtsuka, 2022).
%t a[n_] := LucasL[2*LucasL[n]] + LucasL[2*LucasL[n + 1]]; Array[a, 11, 0]
%Y Cf. A000032, A356760.
%K nonn
%O 0,1
%A _Amiram Eldar_, Aug 26 2022
|
