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!)
A068475 a(n) = Sum_{m=0..n} m*n^(m-1). 4
0, 1, 5, 34, 313, 3711, 54121, 937924, 18831569, 429794605, 10987654321, 310989720966, 9652968253897, 326011399456939, 11901025061692313, 466937872906120456, 19594541482740368161, 875711370981239308953, 41524755927216069067489, 2082225625247428808306410 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
The closed form comes from taking the derivative of the closed form of A031972, for which each term of this sequence is a derivative. - Jonas Whidden, Oct 18 2011
LINKS
FORMULA
a(1) = 1. For n > 1, a(n) = ((n-1)*(n+1)*n^n - n^(n+1) + 1)/(n-1)^2. - Jonas Whidden, Oct 18 2011
a(n) = A062806(n) / n for n>=1. - Reinhard Zumkeller, Nov 22 2014
a(n) = [x^(n-1)] 1/((1 - x)*(1 - n*x)^2). - Peter Bala, Feb 12 2024
EXAMPLE
a(2) = Sum_{m = 1..2} m*2^(m-1) = 1 + 2*2 = 5.
MAPLE
a := n->sum(m*n^(m-1), m=1..n);
MATHEMATICA
Join[{0}, Table[Sum[m*n^(m-1), {m, 0, n}], {n, 1, 30}]] (* G. C. Greubel, Oct 13 2018 *)
PROG
(Haskell)
a068475 n = sum $ zipWith (*) [1..n] $ iterate (* n) 1
-- Reinhard Zumkeller, Nov 22 2014
(PARI) for(n=0, 30, print1(if(n==0, 0, sum(m=0, n, m*n^(m-1))), ", ")) \\ G. C. Greubel, Oct 13 2018
(Magma) [0] cat [(&+[m*n^(m-1): m in [0..n]]): n in [1..30]]; // G. C. Greubel, Oct 13 2018
CROSSREFS
Derivative sequence of A031972.
Sequence in context: A362912 A328488 A258179 * A097817 A344556 A303175
KEYWORD
nonn,easy
AUTHOR
Francois Jooste (phukraut(AT)hotmail.com), Mar 10 2002
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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)