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.
%I A343539 #25 Jan 01 2024 19:46:58
%S A343539 1,12,55,203,684,2189,6773,20460,60707,177631,513996,1473817,4194025,
%T A343539 11858508,33345679,93320819,260079468,722163365,1998685277,5515470636,
%U A343539 15180186491,41680890247,114197428620,312260427313,852296004049,2322415005324,6318599122663,17166545274395
%N A343539 a(n) = (2*n+1)*Lucas(2*n+1).
%H A343539 Andrew Howroyd, <a href="/A343539/b343539.txt">Table of n, a(n) for n = 0..1000</a>
%H A343539 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (6,-11,6,-1).
%F A343539 G.f.: (1-x)*(1 + 7*x + x^2)/(1 - 3*x + x^2)^2.
%F A343539 a(n) = (2*n+1)*A000032(2*n+1).
%F A343539 a(n) = A146005(2*n+1).
%F A343539 a(n) = 6*a(n-1) - 11*a(n-2) + 6*a(n-3) - a(n-4). - _Wesley Ivan Hurt_, Apr 19 2021
%t A343539 Table[(2n+1) LucasL[2n+1], {n, 0, 30}] (* _Wesley Ivan Hurt_, Apr 19 2021 *)
%o A343539 (Magma) [(2*n+1)*Lucas(2*n+1) : n in [0..40]]; // _Wesley Ivan Hurt_, Apr 19 2021
%o A343539 (PARI) a(n) = (2*n+1)*(fibonacci(2*n+2)+fibonacci(2*n)) \\ _Andrew Howroyd_, Jan 01 2024
%Y A343539 Bisection of A146005.
%Y A343539 Cf. A000032, A002878.
%K A343539 nonn,easy
%O A343539 0,2
%A A343539 _Harry Richman_, Apr 16 2021