The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #16 Feb 13 2024 08:34:26
%S 1,10,102,1252,18555,324726,6565468,150652552,3868151445,109876543210,
%T 3420886930626,115835619046764,4238148192940207,166614350863692382,
%U 7004068093591806840,313512663723845890576,14887093306681068252201,747445606689889243214802
%N a(n) = Sum_{i=1..n} i*n^i.
%H Reinhard Zumkeller, <a href="/A062806/b062806.txt">Table of n, a(n) for n = 1..250</a>
%F a(n) = (n^(n+1)*(n^2-n-1) + n)/(n-1)^2 for n>1. - _Dean Hickerson_, Jun 26, 2001
%F a(n) = n * A068475(n). - _Reinhard Zumkeller_, Nov 22 2014
%t Sum[i*n^i, {i, 1, n}]
%o (Haskell)
%o a062806 n = sum $ zipWith (*) [1..n] $ iterate (* n) n
%o -- _Reinhard Zumkeller_, Nov 22 2014
%Y Cf. A068475.
%K nonn,easy
%O 1,2
%A _Olivier Gérard_, Jun 23 2001