The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A002629 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A002629

Number of permutations of length n with one 3-sequence.
(history; published version)

#32 by Jon E. Schoenfield at Sun Dec 19 10:08:13 EST 2021

STATUS

editing

approved

#31 by Jon E. Schoenfield at Sun Dec 19 10:08:11 EST 2021

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing

#30 by Max Alekseyev at Wed Mar 18 08:53:10 EDT 2015

STATUS

editing

approved

#29 by Max Alekseyev at Wed Mar 18 08:53:05 EDT 2015

FORMULA

a(n) = Sum(Cbinomial(n-k-2,k-1)*dA000166(n-k), k=1..floor((n-1)/2)), where d(j) = A000166(j) are the derangement numbers. - Emeric Deutsch, Sep 07 2010

CROSSREFS

Cf. A000166, A047921.

Cf. A000166. - Emeric Deutsch, Sep 07 2010

STATUS

approved

editing

#28 by Vaclav Kotesovec at Mon Mar 16 14:33:54 EDT 2015

STATUS

editing

approved

#27 by Vaclav Kotesovec at Mon Mar 16 14:33:46 EDT 2015

FORMULA

a(n) ~ (n-1)! * (1 - 4/n + 13/(2*n^2) + 29/(6*n^3) - 551/(24*n^4) - 1101/(20*n^5) + 58879/(720*n^6)). - Vaclav Kotesovec, Mar 17 201416 2015

STATUS

approved

editing

#26 by Vaclav Kotesovec at Mon Mar 17 08:15:17 EDT 2014

STATUS

editing

approved

#25 by Vaclav Kotesovec at Mon Mar 17 08:15:11 EDT 2014

FORMULA

a(n) ~ (n-1)!. - Vaclav Kotesovec, Mar 17 2014

STATUS

approved

editing

#24 by Bruno Berselli at Thu Mar 13 07:42:58 EDT 2014

STATUS

proposed

approved

#23 by Jean-François Alcover at Thu Mar 13 05:47:25 EDT 2014

STATUS

editing

proposed