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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078509 Number of permutations p of {1,2,...,n} such that p(i)-i != 1 and p(i)-i != 2 for all i. 0
1, 1, 1, 5, 23, 131, 883, 6859, 60301, 591605, 6405317, 75843233, 974763571, 13512607303, 200949508327, 3190881283415, 53880906258521, 964039575154409, 18217997734199113, 362584510633666621 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

G.f.: x/(1+x)*Sum_{n>=0} (n+1)!*(x/(1+x)^2)^n. a(n) = Sum_{k=1..n} (-1)^(n-k)*k!*binomial(n+k-2,2*k-2). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 16 2007

CROSSREFS

Cf. A000255, A055790, A001883, A001887, A075851, A075852.

Sequence in context: A020032 A186755 A009321 * A077240 A129098 A047049

Adjacent sequences:  A078506 A078507 A078508 * A078510 A078511 A078512

KEYWORD

nonn

AUTHOR

Vladimir Baltic, Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 05 2003

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 14 23:53 EST 2012. Contains 205689 sequences.