Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062805
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062805 Sum i*n^(n - i), i = 1..n. +0
2
0, 1, 4, 18, 112, 975, 11196, 160132, 2739136, 54481005, 1234567900, 31384283766, 884241366768, 27342891567355, 920521275490012, 33512287529147400, 1311768467463790336, 54933923640889550745, 2450641333409472928572 (list; graph; listen)
OFFSET

0,3

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,100

FORMULA

a(n) = (n^(n+1)-n^2)/(n-1)^2 for n>1. - Dean Hickerson, Jun 26, 2001

EXAMPLE

a(0) = 0*0^0 = 0*1 = 0;

a(1) = 0*1^1 + 1*1^0 = 0 + 1 = 1;

a(2) = 0*2^2 + 1*2^1 + 2*2^0 = 0 + 2 + 2 = 4;

a(3) = 0*3^3 + 1*3^2 + 2*3^1 + 3*3^0 = 0 + 9 + 2*3 + 3*1 = 18.

MATHEMATICA

Sum[i*n^(n - i), {i, 1, n}]

PROGRAM

(PARI) { for (n=0, 100, if (n>1, a=(n^(n + 1) - n^2)/(n - 1)^2, a=n); write("b062805.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 11 2009]

CROSSREFS

Sequence in context: A000986 A143920 A113356 this_sequence A053483 A052617 A141714

Adjacent sequences: A062802 A062803 A062804 this_sequence A062806 A062807 A062808

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com), Jun 23 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:13 EST 2009. Contains 170430 sequences.


AT&T Labs Research