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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109742 d(n-1) + d(n-2) + (n-1)[d(n-2) + 2d(n-3) + d(n-4)], where d(n), the derangement numbers, are given in A000166.. 1
1, 2, 5, 9, 27, 123, 693, 4653, 36111, 317583, 3118617, 33804177, 400755267, 5156954019, 71572594557, 1065571143093, 16938122939703, 286298719063863, 5127206924693601, 96975312507734553, 1931609062232400747, 40414621201681598667, 886153986344092389957 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

Y.-R. Liu and M. R. Murthy, Sieve methods in combinatorics, J. Combinatorial Theory, Ser. A, 111 (2005), 1-23.

CROSSREFS

Cf. A000166, A109743.

Sequence in context: A006405 A136108 A026297 * A072979 A094600 A139796

Adjacent sequences:  A109739 A109740 A109741 * A109743 A109744 A109745

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), based on a suggestion from Douglas Rogers, Aug 13 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.