login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206810 Sum_{0<j<n} (n^4-j^4). 3

%I #19 Jun 17 2017 03:53:56

%S 15,145,670,2146,5501,12131,23996,43716,74667,121077,188122,282022,

%T 410137,581063,804728,1092488,1457223,1913433,2477334,3166954,4002229,

%U 5005099,6199604,7611980,9270755,11206845,13453650,16047150

%N Sum_{0<j<n} (n^4-j^4).

%C For a guide to related sequences, see A206817.

%H Danny Rorabaugh, <a href="/A206810/b206810.txt">Table of n, a(n) for n = 2..10000</a>

%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (6,-15,20,-15,6,-1).

%F a(n) = n^5-p(n), where p(n) is the n-th partial sum of (j^4).

%F a(n) = t(n)-t(n-1), where t = A206811.

%F a(n) = (n-10*n^3-15*n^4+24*n^5)/30. G.f.: x^2*(x^3+25*x^2+55*x+15) / (x-1)^6. - _Colin Barker_, Jul 11 2014

%e a(2) = 2^4-1^4 = 15.

%e a(3) = (3^4-1^4) + (3^4-2^4) = 145.

%t s[k_] := k^4; t[1] = 0;

%t p[n_] := Sum[s[k], {k, 1, n}];

%t c[n_] := n*s[n] - p[n];

%t t[n_] := t[n - 1] + (n - 1) s[n] - p[n - 1]

%t Table[c[n], {n, 2, 50}] (* A206810 *)

%t Flatten[Table[t[n], {n, 2, 35}]] (* A206811 *)

%o (PARI) Vec(x^2*(x^3+25*x^2+55*x+15)/(x-1)^6 + O(x^100)) \\ _Colin Barker_, Jul 11 2014

%o (Sage) [sum([n^4-j^4 for j in range(1,n)]) for n in range(2,30)] # _Danny Rorabaugh_, Apr 18 2015

%Y Cf. A206817, A206811.

%K nonn,easy

%O 2,1

%A _Clark Kimberling_, Feb 15 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:41 EDT 2024. Contains 371957 sequences. (Running on oeis4.)