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!)
A017116 a(n) = (8*n + 4)^4. 1

%I #19 Apr 25 2023 05:57:51

%S 256,20736,160000,614656,1679616,3748096,7311616,12960000,21381376,

%T 33362176,49787136,71639296,100000000,136048896,181063936,236421376,

%U 303595776,384160000,479785216,592240896,723394816,875213056,1049760000,1249198336,1475789056,1731891456

%N a(n) = (8*n + 4)^4.

%H Vincenzo Librandi, <a href="/A017116/b017116.txt">Table of n, a(n) for n = 0..10000</a>

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).

%F G.f.: -256*(1 + 76*x + 230*x^2 + 76*x^3 + x^4)/(x-1)^5. - _R. J. Mathar_, May 08 2015

%F From _Amiram Eldar_, Apr 25 2023: (Start)

%F a(n) = A017113(n)^4.

%F a(n) = 2^4*A016828(n) = 2^8*A016756(n).

%F Sum_{n>=0} 1/a(n) = Pi^4/24576. (End)

%t (8*Range[0,20]+4)^4 (* or *) LinearRecurrence[{5,-10,10,-5,1},{256,20736,160000,614656,1679616},20] (* _Harvey P. Dale_, Aug 05 2019 *)

%o (Magma) [(8*n+4)^4: n in [0..35] ]; // _Vincenzo Librandi_, Jul 21 2011

%Y Cf. A016756, A016828, A017113.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

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 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)