The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A303730

Number of noncrossing path sets on n nodes with each path having at least two nodes.
(history; published version)

#21 by Alois P. Heinz at Sun Dec 15 11:29:59 EST 2019

STATUS

proposed

approved

#20 by Michael De Vlieger at Sun Dec 15 10:21:55 EST 2019

STATUS

editing

proposed

#19 by Michael De Vlieger at Sun Dec 15 10:21:54 EST 2019

LINKS

Isaac DeJager, Madeleine Naquin, Frank Seidl, <a href="https://www.valpo.edu/mathematics-statistics/files/2019/08/Drube2019.pdf">Colored Motzkin Paths of Higher Order</a>, VERUM 2019.

STATUS

approved

editing

#18 by Bruno Berselli at Tue Jul 03 11:47:18 EDT 2018

STATUS

proposed

approved

#17 by Jean-François Alcover at Tue Jul 03 11:45:09 EDT 2018

STATUS

editing

proposed

#16 by Jean-François Alcover at Tue Jul 03 11:45:02 EDT 2018

MATHEMATICA

InverseSeries[x*(1 - 2*x)^2/(1 - 4*x + 5*x^2 - x^3) + O[x]^30, x] // CoefficientList[#, x]& // Rest (* Jean-François Alcover, Jul 03 2018, from PARI *)

STATUS

approved

editing

#15 by N. J. A. Sloane at Thu May 03 17:03:58 EDT 2018

STATUS

proposed

approved

#14 by Andrew Howroyd at Thu May 03 16:42:21 EDT 2018

STATUS

editing

proposed

#13 by Andrew Howroyd at Thu May 03 12:34:11 EDT 2018

LINKS

Andrew Howroyd, <a href="/A303730/b303730.txt">Table of n, a(n) for n = 0..200</a>

STATUS

approved

editing

#12 by Joerg Arndt at Tue May 01 03:05:08 EDT 2018

STATUS

reviewed

approved