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!)
A074728 a(n) = Sum_{k=1..n} k^(n-k)*binomial(n,k-1). 1

%I #8 Aug 24 2017 12:36:56

%S 1,3,10,39,176,903,5174,32623,223792,1655463,13110758,110510007,

%T 986490272,9287036671,91872460702,952034494431,10305790066208,

%U 116254839687543,1363631057783942,16599343732844455,209328335818064176,2730323984395924623,36780442970179975646

%N a(n) = Sum_{k=1..n} k^(n-k)*binomial(n,k-1).

%F E.g.f.: (exp(x*exp(x))-exp(x))/x.

%t Table[Sum[k^(n-k) Binomial[n,k-1],{k,n}],{n,30}] (* _Harvey P. Dale_, Mar 19 2013 *)

%Y Cf. A000248.

%K nonn

%O 1,2

%A _Vladeta Jovovic_, Sep 05 2002

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 25 10:33 EDT 2024. Contains 371967 sequences. (Running on oeis4.)