login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A031971 a(n) = Sum_{k=1..n} k^n. 58
1, 5, 36, 354, 4425, 67171, 1200304, 24684612, 574304985, 14914341925, 427675990236, 13421957361110, 457593884876401, 16841089312342855, 665478473553144000, 28101527071305611528, 1262899292504270591313 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

From Alexander Adamchuk, Jul 21 2006: (Start)

p^(3k - 1) divides a(p^k) for prime p > 2 and k = 1, 2, 3, 4, ... or p^2 divides a(p) for prime p > 2. p^5 divides a(p^2) for prime p > 2. p^8 divides a(p^3) for prime p > 2. p^11 divides a(p^4) for prime p > 2.

p^2 divides a(2p) for prime p > 3. p^3 divides a(3p) for prime p > 2. p^2 divides a(4p) for prime p > 5. p^3 divides a(5p) for prime p > 3. p^2 divides a(6p) for prime p > 7.

p divides a(2p - 1) for all prime p. p^3 divides a(2p^2 - 1) for all prime p. p^5 divides a(2p^3 - 1) for all prime p.

p divides a((p - 1)/2) for p = 5, 13, 17, 29, 37, 41, 53, 61, ... = A002144 Pythagorean primes: primes of form 4n + 1.

(End)

LINKS

T. D. Noe, Table of n, a(n) for n = 1..100

J. M. Grau, A. M. Oller-Marcen, and J. Sondow, On the congruence 1^m + 2^m + ... + m^m == n (mod m) with n|m, arXiv 1309.7941, 2013.

FORMULA

a(n) is asymptotic to (e/(e - 1))*n^n. - Benoit Cloitre, Dec 17 2003

a(n) = zeta(-n) - zeta(-n, n + 1), where zeta(s) is the Riemann zeta function and zeta(s, a) is the Hurwitz zeta function, a generalization of the Riemann zeta function. - Alexander Adamchuk, Jul 21 2006

a(n) == 1 (mod n) <==> n is in A014117 = 1, 2, 6, 42, 1806 (see the link "On the congruence ..."). - Jonathan Sondow, Oct 18 2013

a(A054377(n)) = A233045(n). - Jonathan Sondow, Dec 11 2013

a(n) = n! * [x^n] exp(x)*(exp(n*x) - 1)/(exp(x) - 1). - Ilya Gutkovskiy, Apr 07 2018

a(n) ~ ((e*n+1)/((e-1)*(n+1))) * n^n. - N. J. A. Sloane, Oct 13 2018, based on email from Claude F. Leibovici who claims this is slightly better than Cloitre's version when n is small.

MAPLE

a := n->sum('i'^n, 'i'=1..n);

# alternative

A031971 := proc(n)

    (bernoulli(n+1, n+1)-bernoulli(n+1))/(n+1) ;

end proc: # R. J. Mathar, May 10 2013

MATHEMATICA

Table[Zeta[-n] - Zeta[-n, n + 1], {n, 25}] (* Alexander Adamchuk, Jul 21 2006 *)

Table[Total[Range[n]^n], {n, 25}] (* T. D. Noe, Apr 19 2011 *)

Table[HarmonicNumber[n, -n], {n, 1, 25}] (* Jean-Fran├žois Alcover, Apr 09 2015 *)

PROG

(MAGMA) [&+[(k)^n: k in [0..n]]: n in [1..30]]; // Vincenzo Librandi, Apr 18 2011

(Haskell)

a031971 = sum . a089072_row  -- Reinhard Zumkeller, Mar 18 2013

(PARI) a(n)=sum(k=1, n, k^n) \\ Charles R Greathouse IV, Jun 05 2015

CROSSREFS

A diagonal of array A103438.

Cf. A002144, A014117, A089072, A229303, A256016, A261490.

For a(n) mod n see A182398.

Sequence in context: A008785 A081918 A062024 * A247496 A302584 A230887

Adjacent sequences:  A031968 A031969 A031970 * A031972 A031973 A031974

KEYWORD

nonn,nice,easy

AUTHOR

Chris du Feu (chris(AT)beckingham0.demon.co.uk)

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 20:44 EDT 2019. Contains 328315 sequences. (Running on oeis4.)