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 A165283 #18 May 09 2023 18:38:47
%S A165283 1,48,1280,28672,589824,11534336,218103808,4026531840,73014444032,
%T A165283 1305670057984,23089744183296,404620279021568,7036874417766400,
%U A165283 121597189939003392,2089670227099910144,35740566642812256256,608742554432415203328,10330176681277348904960
%N A165283 a(n) = (2*n + 1)*16^n.
%H A165283 Vincenzo Librandi, <a href="/A165283/b165283.txt">Table of n, a(n) for n = 0..200</a>
%H A165283 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (32,-256).
%F A165283 G.f.: (1+16*x)/(1-16*x)^2.
%F A165283 Sum_{n>=0} 1/a(n) = 2*log(5/3).
%F A165283 Sum_{n>=0} (-1)^n/a(n) = 4 * arctan(1/4). - _Amiram Eldar_, Jul 12 2020
%F A165283 E.g.f.: exp(16*x)*(1 + 32*x). - _Stefano Spezia_, May 09 2023
%o A165283 (PARI) a(n)=(2*n+1)*16^n
%o A165283 (Magma) [(2*n+1)*16^n: n in [0..20]]; // _Vincenzo Librandi_, Jun 08 2011
%Y A165283 Cf. A058962 ((2n+1)4^n), A155988 ((2n+1)9^n).
%K A165283 nonn,easy
%O A165283 0,2
%A A165283 _Jaume Oliver Lafont_, Sep 13 2009