The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A135413

Number of at most 4-way branching ordered (i.e., plane) trees.
(history; published version)

#33 by Alois P. Heinz at Fri Oct 27 20:52:55 EDT 2023

STATUS

editing

approved

#32 by Alois P. Heinz at Fri Oct 27 20:52:52 EDT 2023

LINKS

G. C. Greubel and Alois P. Heinz, <a href="/A135413/b135413.txt">Table of n, a(n) for n = 1..1000</a> (first 250 terms from G. C. Greubel)

STATUS

approved

editing

#31 by Peter Luschny at Mon Apr 01 08:30:16 EDT 2019

STATUS

reviewed

approved

#30 by Joerg Arndt at Mon Apr 01 07:11:40 EDT 2019

STATUS

proposed

reviewed

#29 by Joerg Arndt at Mon Apr 01 07:11:36 EDT 2019

STATUS

editing

proposed

#28 by Joerg Arndt at Mon Apr 01 07:11:33 EDT 2019

FORMULA

a(n) = Sum_{i=0..floor((n-1)/5)} (-1)^i * C(n,i) * C(2*n-5*i-2,n-5*i-1). - Vladimir Kruchinin, Mar 28 2019

STATUS

proposed

editing

#27 by Vladimir Kruchinin at Fri Mar 29 11:45:47 EDT 2019

STATUS

editing

proposed

#26 by Vladimir Kruchinin at Fri Mar 29 11:45:30 EDT 2019

FORMULA

a(n) = Sum_{i=0..floor((n-1)/5)} (-1)^i*C(n,i)*C(2*n-5*i-2,n-5*i-1). - Vladimir Kruchinin, Mar 28 2019

STATUS

proposed

editing

#25 by Vladimir Kruchinin at Fri Mar 29 11:44:48 EDT 2019

STATUS

editing

proposed

#24 by Vladimir Kruchinin at Fri Mar 29 11:44:13 EDT 2019

FORMULA

a(n) = Sum_{i=0..floor(n-1)/5} (-1)^i*C(n,i)*C(2*n-5*i-2,n-5*i-1). - Vladimir Kruchinin, Mar 28 2019

STATUS

proposed

editing