login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088992 Derangement numbers d(n,5) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0. 3
1, 0, 5, 50, 825, 17500, 458125, 14268750, 515440625, 21188375000, 976671703125, 49893003906250, 2797832158515625, 170863509745312500, 11287987223748828125, 802119551344589843750, 61005565392625400390625, 4944614795517599218750000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

In general, d(n,k) is asymptotic to sqrt(2*Pi) * k^n * n^(n + 1/2) / (Gamma(1/k) * exp((n*k+1)/k) * n^((k-1)/k)), for k>0. - Vaclav Kotesovec, Oct 31 2017

LINKS

Table of n, a(n) for n=0..17.

FORMULA

Inverse binomial transform of A008548. E.g.f.: exp(-x)/(1-5*x)^(1/5). - Vladeta Jovovic, Dec 17 2003

a(n) ~ Pi * sqrt(2) * n^(n-3/10) * 5^n / (sqrt(Pi) * Gamma(1/5) * exp(n + 1/5)). - Vaclav Kotesovec, Oct 31 2017

CROSSREFS

Cf. A000166, A053871, A033030, A088991.

Sequence in context: A047054 A052562 A113132 * A320502 A116906 A051893

Adjacent sequences:  A088989 A088990 A088991 * A088993 A088994 A088995

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Nov 02 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 23:48 EDT 2019. Contains 322465 sequences. (Running on oeis4.)