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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017093 a(n) = (8*n + 2)^5. 1
 32, 100000, 1889568, 11881376, 45435424, 130691232, 312500000, 656356768, 1252332576, 2219006624, 3707398432, 5904900000, 9039207968, 13382255776, 19254145824, 27027081632, 37129300000, 50049003168, 66338290976, 86617093024, 111577100832, 141985700000, 178689902368 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..10000 Index entries for linear recurrences with constant coefficients, signature (6,-15,20,-15,6,-1). FORMULA 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 From Amiram Eldar, Apr 24 2023: (Start) a(n) = A017089(n)^5. a(n) = 2^5*A016817(n). Sum_{n>=0} 1/a(n) = 5*Pi^5/98304 + 31*zeta(5)/2048. (End) MATHEMATICA (8Range[0, 20]+2)^5 (* Harvey P. Dale, Feb 24 2011 *) PROG (Magma) [(8*n+2)^5: n in [0..30]]; // Vincenzo Librandi, Jul 12 2011 CROSSREFS Cf. A013663, A016817, A017089 (8n+2), A000584 (n^5). Sequence in context: A176030 A034245 A230566 * A159412 A201987 A217272 Adjacent sequences: A017090 A017091 A017092 * A017094 A017095 A017096 KEYWORD nonn,easy AUTHOR N. J. A. Sloane STATUS approved

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.

Last modified December 5 13:14 EST 2023. Contains 367591 sequences. (Running on oeis4.)