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 A276041 #10 May 08 2017 00:16:10
%S A276041 1,6,28,104,336,992,2752,7296,18688,46592,113664,272384,643072,
%T A276041 1499136,3457024,7897088,17891328,40239104,89915392,199753728,
%U A276041 441450496,970981376,2126512128,4638900224,10083106816,21843935232,47177531392,101602820096,218238025728
%N A276041 Exponential convolution of odd numbers (A005408) with themselves.
%H A276041 M. Bernstein and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.CO/0205301">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72. Erratum 320 (2000), 210. [Link to arXiv version]
%H A276041 M. Bernstein and N. J. A. Sloane, <a href="/A003633/a003633_1.pdf">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
%H A276041 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6,-12,8)
%F A276041 O.g.f.: (1 + 4*x^2)/(1 - 2*x)^3.
%F A276041 E.g.f.: (1 + 2*x)^2*exp(2*x).
%F A276041 a(n) = 6*a(n-1) - 12*a(n-2) + 8*a(n-3).
%F A276041 a(n) = 2^n*(n^2 + n + 1).
%F A276041 a(n) = A000079(n)*A002061(n+1).
%F A276041 Binomial transform of A053755.
%t A276041 LinearRecurrence[{6, -12, 8}, {1, 6, 28}, 29]
%t A276041 Table[2^n (n^2 + n + 1), {n, 0, 28}]
%Y A276041 Cf. A000079, A002061, A005408, A053755, A128796 (exponential convolution of even numbers with themselves).
%K A276041 nonn,easy
%O A276041 0,2
%A A276041 _Ilya Gutkovskiy_, Aug 17 2016