cp's OEIS Frontend

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.

A254366 a(n) = 4^n + 10*2^n + 4*3^n + 20.

This page as a plain text file.
%I A254366 #23 Jun 13 2015 00:55:23
%S A254366 35,56,112,272,760,2336,7672,26432,94360,346016,1295032,4923392,
%T A254366 18943960,73568096,287731192,1131465152,4467809560,17697740576,
%U A254366 70271780152,279532195712,1113469251160,4439908895456,17717752225912,70745400779072,282604862628760
%N A254366 a(n) = 4^n + 10*2^n + 4*3^n + 20.
%C A254366 This is the sequence of fourth terms of "fourth partial sums of m-th powers".
%H A254366 Colin Barker, <a href="/A254366/b254366.txt">Table of n, a(n) for n = 0..1000</a>
%H A254366 Luciano Ancora, <a href="/A254366/a254366.pdf">Demonstration of formulas</a>, page 2.
%H A254366 Luciano Ancora, <a href="/A254366/a254366_1.pdf">Recurrence relations for partial sums of m-th powers</a>
%H A254366 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (10,-35,50,-24).
%F A254366 G.f.: -(638*x^3-777*x^2+294*x-35) / ((x-1)*(2*x-1)*(3*x-1)*(4*x-1)). - _Colin Barker_, Jan 30 2015
%F A254366 a(n) = 10*a(n-1)-35*a(n-2)+50*a(n-3)-24*a(n-4). - _Colin Barker_, Jan 30 2015
%t A254366 Table[4^n + 10*2^n + 4*3^n + 20, {n, 0, 28}] (* _Michael De Vlieger_, Jan 30 2015 *)
%o A254366 (PARI) vector(30, n, n--; 4^n + 10*2^n + 4*3^n + 20) \\ _Colin Barker_, Jan 30 2015
%Y A254366 Cf. A140504, A254365, A254367.
%K A254366 nonn,easy
%O A254366 0,1
%A A254366 _Luciano Ancora_, Jan 29 2015