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 A254365 #21 Jun 13 2015 00:55:23
%S A254365 15,21,35,69,155,381,995,2709,7595,21741,63155,185349,547835,1627101,
%T A254365 4848515,14479989,43308875,129664461,388469075,1164358629,3490978715,
%U A254365 10468741821,31397836835,94176733269,282496645355,847422827181,2542134263795,7626134355909
%N A254365 a(n) = 2^(n+2) + 3^n + 10.
%C A254365 This is the sequence of third terms of "fourth partial sums of m-th powers".
%H A254365 Colin Barker, <a href="/A254365/b254365.txt">Table of n, a(n) for n = 0..1000</a>
%H A254365 Luciano Ancora, <a href="/A254365/a254365.pdf">Demonstration of formulas</a>, page 1.
%H A254365 Luciano Ancora, <a href="/A254365/a254365_1.pdf">Recurrence relations for partial sums of m-th powers</a>
%H A254365 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6,-11,6).
%F A254365 G.f.: -(74*x^2-69*x+15) / ((x-1)*(2*x-1)*(3*x-1)). - _Colin Barker_, Jan 30 2015
%F A254365 a(n) = 6*a(n-1)-11*a(n-2)+6*a(n-3). - _Colin Barker_, Jan 30 2015
%t A254365 Table[2^(n+2) + 3^n + 10, {n, 0, 30}] (* _Bruno Berselli_, Jan 30 2015 *)
%o A254365 (PARI) vector(30, n, n--; 2^(n+2) + 3^n + 10) \\ _Colin Barker_, Jan 30 2015
%Y A254365 Cf. A140504, A254366, A254367.
%K A254365 nonn,easy
%O A254365 0,1
%A A254365 _Luciano Ancora_, Jan 29 2015