STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A184185
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Number of permutations of {1,2,...,n} having no cycles of the form (i, i+1, i+2, ..., i+j-1) (j >= 1).
(history; published version)
(history; published version)
STATUS
proposed
reviewed
STATUS
editing
proposed
FORMULA
G.f.: (1-z)*F(z-z^2), where F(z) = Sum_{j>=0} j!*z^j (private communication from Vladeta Jovovic, May 26 2009).
STATUS
proposed
editing
STATUS
editing
proposed
FORMULA
From _a(n) = (n+2) * a(n-1) - 2 * (n-1) * a(n-2) + (n-2) * a(n-3) for n > 2. - _Seiichi Manyama_, Nov 30 2021: (Start)
a(n) = (n+2) * a(n-1) - 2 * (n-1) * a(n-2) + (n-2) * a(n-3) for n > 2.
G.f.: Sum_{k>=0} k! * x^k * (1 - x)^(k+1). (End)
STATUS
approved
editing
STATUS
reviewed
approved
STATUS
proposed
reviewed
STATUS
editing
proposed