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

%I #20 Oct 12 2016 08:56:13

%S 0,1,10,141,2584,58745,1602576,51165205,1874935168,77644293201,

%T 3588075308800,183111507687581,10230243235200000,621111794820235849,

%U 40722033570202507264,2867494972696071121125,215840579093024990396416,17294837586403146090259745,1469799445329208661211021312

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

%F a(n) = n!*LaguerreL(n, -n) - n^n.

%F a(n) = (-1)^n*KummerU(-n, 1, -n) - n^n.

%F a(n) = n^n*(hypergeom([-n, -n], [], 1/n) - 1) for n>=1.

%F a(n) ~ n^n * phi^(2*n+1) * exp(n/phi-n) / 5^(1/4), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - _Vaclav Kotesovec_, Oct 12 2016

%p a := n -> add(binomial(n,n-k)*n^(n-k)*n!/(n-k)!, k=1..n):

%p seq(a(n), n=0..18);

%p # Alternatively:

%p A277372 := n -> n!*LaguerreL(n,-n) - n^n:

%p seq(simplify(A277372(n)), n=0..18);

%o (PARI) a(n) = sum(k=1, n, binomial(n,n-k)*n^(n-k)*n!/(n-k)!); \\ _Michel Marcus_, Oct 12 2016

%Y Cf. A097662, A239768.

%Y Cf. A002720, A087912, A277382.

%K nonn

%O 0,3

%A _Peter Luschny_, Oct 11 2016

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