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 A199301 #28 May 09 2023 08:57:30
%S A199301 1,24,320,3584,36864,360448,3407872,31457280,285212672,2550136832,
%T A199301 22548578304,197568495616,1717986918400,14843406974976,
%U A199301 127543348822016,1090715534753792,9288674231451648,78812993478983680,666532744850833408,5620492334958379008,47269781688880726016
%N A199301 a(n) = (2n+1)*8^n.
%H A199301 Vincenzo Librandi, <a href="/A199301/b199301.txt">Table of n, a(n) for n = 0..1000</a>
%H A199301 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (16,-64).
%F A199301 a(n) = 16*a(n-1)-64*a(n-2).
%F A199301 G.f.: (1+8*x)/(1-8*x)^2.
%F A199301 a(n) = 8*(a(n-1)+2^(3*n-2)). - _Vincenzo Librandi_, Nov 05 2011
%F A199301 a(n) = A005408(n) * A001018(n). - _Wesley Ivan Hurt_, Oct 30 2014
%F A199301 From _Amiram Eldar_, Dec 10 2022: (Start)
%F A199301 Sum_{n>=0} 1/a(n) = sqrt(8)*arccoth(sqrt(8)).
%F A199301 Sum_{n>=0} (-1)^n/a(n) = sqrt(8)*arccot(sqrt(8)). (End)
%F A199301 E.g.f.: exp(8*x)*(1 + 16*x). - _Stefano Spezia_, May 09 2023
%p A199301 A199301:=n->(2*n+1)*8^n: seq(A199301(n), n=0..20); # _Wesley Ivan Hurt_, Oct 30 2014
%t A199301 Table[(2 n + 1)*8^n, {n, 0, 20}] (* _Wesley Ivan Hurt_, Oct 30 2014 *)
%o A199301 (Magma) [(2*n+1)*8^n: n in [0..30]]; // _Vincenzo Librandi_, Nov 05 2011
%o A199301 (PARI) a(n) = (2*n+1)*8^n \\ _Amiram Eldar_, Dec 10 2022
%Y A199301 Cf. A001018 (Powers of 8), A005408 (2n+1).
%Y A199301 Cf. A014480, A058962, A124647, A155988, A171220, A199299, A199300.
%K A199301 nonn,easy
%O A199301 0,2
%A A199301 _Philippe Deléham_, Nov 04 2011
%E A199301 a(18) corrected by _Vincenzo Librandi_, Nov 05 2011