[go: up one dir, main page]

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

Showing entries 1-10 | older changes
Number of length n inversion sequences avoiding the patterns 110, 120, 201, and 210.
(history; published version)
#17 by Vaclav Kotesovec at Thu Oct 07 04:37:42 EDT 2021
STATUS

editing

approved

#16 by Vaclav Kotesovec at Thu Oct 07 04:36:53 EDT 2021
FORMULA

a(n) ~ c * d^n / n^(3/2), where d = 5.98041772076926677236919875200507... is the positive root of the equation -32 - 195*d - 12*d^2 - 112*d^3 + 20*d^4 = 0 and c = 0.1056946795054351807407212356928404107733262398133039312067247126343... - Vaclav Kotesovec, Oct 07 2021

STATUS

approved

editing

#15 by N. J. A. Sloane at Fri Jan 05 15:11:26 EST 2018
STATUS

editing

approved

#14 by N. J. A. Sloane at Fri Jan 05 15:11:21 EST 2018
COMMENTS

It was proven shown that a_n also counts those length n inversion sequences with no entries e_i, e_j, e_k (where i<j<k) such that e_i <> e_j and e_i > e_k. This is the same as the set of length n inversion sequences avoiding 100, 120, 201, and 210.

STATUS

approved

editing

#13 by Alois P. Heinz at Mon Jul 10 08:20:34 EDT 2017
STATUS

proposed

approved

#12 by Jean-François Alcover at Mon Jul 10 08:07:41 EDT 2017
STATUS

editing

proposed

#11 by Jean-François Alcover at Mon Jul 10 08:07:35 EDT 2017
MATHEMATICA

b[n_, i_, l_] := b[n, i, l] = If[n == 0, 1, Sum[b[n-1, i-#+2, j-#+1]& @ Max[1, If[j == l, 0, l]], {j, 1, i}]]; a[n_] := b[n, 1, 1]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Jul 10 2017, after Alois P. Heinz *)

STATUS

approved

editing

#10 by Alois P. Heinz at Thu Feb 23 16:40:10 EST 2017
STATUS

editing

approved

#9 by Alois P. Heinz at Thu Feb 23 16:39:26 EST 2017
LINKS

Alois P. Heinz, <a href="/A279568/b279568.txt">Table of n, a(n) for n = 0..1294</a>

Discussion
Thu Feb 23
16:40
Alois P. Heinz: done ...
#8 by Alois P. Heinz at Thu Feb 23 16:33:53 EST 2017
MAPLE

b(n-1, i-h+2, j-h+1))(max(1, `if`(j<>l, =l, 0, l))), j=1..i))