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 A130129 #31 Sep 29 2022 02:15:13
%S A130129 1,8,28,80,208,512,1216,2816,6400,14336,31744,69632,151552,327680,
%T A130129 704512,1507328,3211264,6815744,14417920,30408704,63963136,134217728,
%U A130129 281018368,587202560,1224736768,2550136832,5301600256,11005853696,22817013760
%N A130129 a(n) = (3*n+1)*2^n.
%H A130129 Vincenzo Librandi, <a href="/A130129/b130129.txt">Table of n, a(n) for n = 0..300</a>
%H A130129 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-4).
%F A130129 a(n+1) - a(n) = A066373(n+3). - _J. M. Bergot_, Apr 21 2013
%F A130129 G.f.: ( 1+4*x ) / (1-2*x)^2. - _R. J. Mathar_, Apr 25 2013
%F A130129 E.g.f.: (1+6*x)*exp(2*x). - _G. C. Greubel_, Sep 28 2022
%t A130129 Table[2^n*(3*n+1), {n,0,30}] (* _G. C. Greubel_, Sep 28 2022 *)
%o A130129 (Magma) [(3*n+1)*2^n: n in [0..30]]; // _Vincenzo Librandi_, May 04 2011
%o A130129 (SageMath) [2^n*(3*n+1) for n in range(30)] # _G. C. Greubel_, Sep 28 2022
%Y A130129 Cf. A016921 (inverse binomial transform).
%Y A130129 Cf. A062111, A066373.
%K A130129 nonn,easy
%O A130129 0,2
%A A130129 _Paul Curtz_, Aug 01 2007