Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088992
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
5
1, 0, 5, 50, 825, 17500, 458125, 14268750, 515440625, 21188375000, 976671703125, 49893003906250, 2797832158515625, 170863509745312500, 11287987223748828125, 802119551344589843750, 61005565392625400390625, 4944614795517599218750000 (list; graph; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

Cf. A000166, A053871, A033030, A088991.

Sequence in context: A047054 A052562 A113132 this_sequence A116906 A051893 A082100

Adjacent sequences: A088989 A088990 A088991 this_sequence A088993 A088994 A088995

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 02 2003

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research