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 A254362 #27 Oct 11 2024 13:11:10
%S A254362 10,15,27,57,135,345,927,2577,7335,21225,62127,183297,543735,1618905,
%T A254362 4832127,14447217,43243335,129533385,388206927,1163834337,3489930135,
%U A254362 10466644665,31393642527,94168344657,282479868135,847389272745,2542067154927,7626000138177
%N A254362 a(n) = 3*2^n + 3^n + 6.
%C A254362 This is the sequence of third terms of "third partial sums of m-th powers".
%C A254362 Is this 10 followed by A087719? [_Bruno Berselli_, Jan 30 2015]
%H A254362 Colin Barker, <a href="/A254362/b254362.txt">Table of n, a(n) for n = 0..1000</a>
%H A254362 Luciano Ancora, <a href="/A254362/a254362.pdf">Demonstration of formulas</a>, page 1.
%H A254362 Luciano Ancora, <a href="/A254362/a254362_1.pdf">Recurrence relations for partial sums of m-th powers</a>
%H A254362 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6,-11,6).
%F A254362 G.f.: -(47*x^2-45*x+10) / ((x-1)*(2*x-1)*(3*x-1)). - _Colin Barker_, Jan 30 2015
%F A254362 a(n) = 6*a(n-1) -11*a(n-2) +6*a(n-3). - _Colin Barker_, Jan 30 2015
%t A254362 Table[3 * 2^n + 3^n + 6, {n, 0, 29}] (* _Alonso del Arte_, Jan 29 2015 *)
%t A254362 LinearRecurrence[{6,-11,6},{10,15,27},30] (* _Harvey P. Dale_, Oct 11 2024 *)
%o A254362 (PARI) vector(30, n, n--; 3*2^n + 3^n + 6) \\ _Colin Barker_, Jan 30 2015
%Y A254362 Cf. A062709, A254363, A254364.
%K A254362 nonn,easy
%O A254362 0,1
%A A254362 _Luciano Ancora_, Jan 29 2015