[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A188919 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Triangle read by rows: T(n,k) = number of permutations of length n with k inversions that avoid the "dashed pattern" 1-32.
(history; published version)
#33 by Alois P. Heinz at Fri Dec 28 15:33:36 EST 2018
STATUS

editing

approved

#32 by Alois P. Heinz at Fri Dec 28 15:31:55 EST 2018
CROSSREFS

The column limits are given by A188920. Cf. A000110.

Cf. A000110, A161680.

STATUS

approved

editing

#31 by Alois P. Heinz at Tue Nov 07 17:41:38 EST 2017
STATUS

proposed

approved

#30 by Eric M. Schmidt at Tue Nov 07 17:35:04 EST 2017
STATUS

editing

proposed

#29 by Eric M. Schmidt at Tue Nov 07 17:34:57 EST 2017
LINKS

Jean-Christophe Novelli, Jean-Yves Thibon, Frédéric Toumazet, <a href="https://arxiv.org/abs/1705.08113">Noncommutative Bell polynomials and the dual immaculate basis</a>, arXiv:1705.08113 [math.CO], 2017.

STATUS

approved

editing

#28 by N. J. A. Sloane at Sat Jun 24 16:23:11 EDT 2017
LINKS

A. M. Baxter, <a href="httphttps://www.mathpdfs.rutgerssemanticscholar.edu/~baxter/papersorg/thesis2c5d/79e361d3aecb25c380402144177ad7cd9dc8.pdf">Algorithms for Permutation Statistics</a>, Ph. D. Dissertation, Rutgers University, May 2011.

Discussion
Sat Jun 24
16:23
OEIS Server: https://oeis.org/edit/global/2684
#27 by Alois P. Heinz at Mon Feb 01 08:58:49 EST 2016
STATUS

proposed

approved

#26 by Jean-François Alcover at Mon Feb 01 08:55:32 EST 2016
STATUS

editing

proposed

#25 by Jean-François Alcover at Mon Feb 01 08:55:24 EST 2016
MATHEMATICA

b[u_, o_] := b[u, o] = Expand[If[u+o == 0, 1, Sum[b[u-j, o+j-1]* x^(o+j-1), {j, 1, u}] + Sum[If[u == 0, b[u+j-1, o-j]*x^(o-j), 0], {j, 1, o}]]]; T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 0, Exponent[p, x]}] ][b[0, n]]; Table[T[n], {n, 0, 10}] // Flatten (* Jean-François Alcover, Feb 01 2016, after Alois P. Heinz *)

STATUS

approved

editing

#24 by Alois P. Heinz at Sat Nov 14 03:43:21 EST 2015
STATUS

editing

approved