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!)
A000584 Fifth powers: a(n) = n^5.
(Formerly M5231 N2277)
182
0, 1, 32, 243, 1024, 3125, 7776, 16807, 32768, 59049, 100000, 161051, 248832, 371293, 537824, 759375, 1048576, 1419857, 1889568, 2476099, 3200000, 4084101, 5153632, 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Totally multiplicative sequence with a(p) = p^5 for prime p. - Jaroslav Krizek, Nov 01 2009
The binomial transform yields A059338. The inverse binomial transform yields the (finite) 0, 1, 30, 150, 240, 120, the 5th row in A019538 and A131689. - R. J. Mathar, Jan 16 2013
Equals sum of odd numbers from n^2*(n-1)+1 (A100104) to n^2*(n+1)-1 (A003777). - Bruno Berselli, Mar 14 2014
a(n) mod 10 = n mod 10. - Reinhard Zumkeller, May 10 2014
Numbers of the form a(n) + a(n+1) + ... + a(n+k) are nonprime for all n, k>=0; this can be proved by the method indicated in the comment in A256581. - Vladimir Shevelev and Peter J. C. Moses, Apr 04 2015
REFERENCES
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 255; 2nd. ed., p. 269. Worpitzky's identity (6.37).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Franklin T. Adams-Watters, Table of n, a(n) for n = 0..500
Brady Haran and Simon Pampena, Fifth Root Trick, Numberphile video (2014)
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
FORMULA
G.f.: x*(1+26*x+66*x^2+26*x^3+x^4) / (x-1)^6. [Simon Plouffe in his 1992 dissertation]
Multiplicative with a(p^e) = p^(5e). - David W. Wilson, Aug 01 2001
E.g.f.: exp(x)*(x+15*x^2+25*x^3+10*x^4+x^5). - Geoffrey Critzer, Jun 12 2013
a(n) = 5*a(n-1) - 10* a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) + 120. - Ant King, Sep 23 2013
a(n) = n + Sum_{j=0..n-1}{k=1..4}binomial(5,k)*j^(5-k). - Patrick J. McNab, Mar 28 2016
From Kolosov Petro, Oct 22 2018: (Start)
a(n) = Sum_{k=1..n} A300656(n,k).
a(n) = Sum_{k=0..n-1} A300656(n,k). (End)
a(n) = Sum_{k=1..5} Eulerian(5, k)*binomial(n+5-k, 5), with Eulerian(5, k) = A008292(5, k), the numbers 1, 26, 66, 26, 1, for n >= 0. Worpitzki's identity for powers of 5. See. e.g., Graham et al., eq. (6, 37) (using A173018, the row reversed version of A123125). - Wolfdieter Lang, Jul 17 2019
From Amiram Eldar, Oct 08 2020: (Start)
Sum_{n>=1} 1/a(n) = zeta(5) (A013663).
Sum_{n>=1} (-1)^(n+1)/a(n) = 15*zeta(5)/16 (A267316). (End)
MATHEMATICA
Range[0, 50]^5 (* Vladimir Joseph Stephan Orlovsky, Feb 20 2011 *)
PROG
(Sage) [n**5 for n in range(30)] # Zerinvary Lajos, Jun 03 2009
(Haskell)
a000584 = (^ 5) -- Reinhard Zumkeller, Nov 11 2012
(Maxima) makelist(n^5, n, 0, 30); /* Martin Ettl, Nov 12 2012 */
(PARI) a(n)=n^5 \\ Charles R Greathouse IV, Jul 28 2015
CROSSREFS
Partial sums give A000539.
Sequence in context: A184979 A257855 A055014 * A352051 A050752 A351603
KEYWORD
nonn,easy,mult
AUTHOR
EXTENSIONS
More terms from Henry Bottomley, Jun 21 2001
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)