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

%I #23 Apr 24 2023 02:54:22

%S 32,100000,1889568,11881376,45435424,130691232,312500000,656356768,

%T 1252332576,2219006624,3707398432,5904900000,9039207968,13382255776,

%U 19254145824,27027081632,37129300000,50049003168,66338290976,86617093024,111577100832,141985700000,178689902368

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

%H Vincenzo Librandi, <a href="/A017093/b017093.txt">Table of n, a(n) for n = 0..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 G.f.: 32*(1 + 3119*x + 40314*x^2 + 63854*x^3 + 15349*x^4 + 243*x^5)/(x-1)^6. - _R. J. Mathar_, Jul 14 2016

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

%F a(n) = A017089(n)^5.

%F a(n) = 2^5*A016817(n).

%F Sum_{n>=0} 1/a(n) = 5*Pi^5/98304 + 31*zeta(5)/2048. (End)

%t (8Range[0,20]+2)^5 (* _Harvey P. Dale_, Feb 24 2011 *)

%o (Magma) [(8*n+2)^5: n in [0..30]]; // _Vincenzo Librandi_, Jul 12 2011

%Y Cf. A013663, A016817, A017089 (8n+2), A000584 (n^5).

%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 24 08:59 EDT 2024. Contains 371935 sequences. (Running on oeis4.)