[go: up one dir, main page]

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 A120803 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of series-reduced balanced trees with n leaves.
(history; published version)
#14 by N. J. A. Sloane at Fri Oct 26 00:51:31 EDT 2018
STATUS

proposed

approved

#13 by Andrew Howroyd at Fri Oct 26 00:46:20 EDT 2018
STATUS

editing

proposed

#12 by Andrew Howroyd at Fri Oct 26 00:45:31 EDT 2018
PROG

(PARI) EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}

seq(n)={my(u=vector(n), v=vector(n)); u[1]=1; while(u, v+=u; u=EulerT(u)-u); v} \\ Andrew Howroyd, Oct 26 2018

STATUS

approved

editing

#11 by Bruno Berselli at Mon Oct 08 11:00:52 EDT 2018
STATUS

reviewed

approved

#10 by Joerg Arndt at Mon Oct 08 10:42:34 EDT 2018
STATUS

proposed

reviewed

#9 by Gus Wiseman at Mon Oct 08 10:40:58 EDT 2018
STATUS

editing

proposed

#8 by Gus Wiseman at Mon Oct 08 03:18:02 EDT 2018
#7 by Gus Wiseman at Sun Oct 07 15:24:41 EDT 2018
#6 by Gus Wiseman at Sun Oct 07 15:23:39 EDT 2018
EXAMPLE

From Gus Wiseman, Oct 07 2018: (Start)

The a(10) = 16 series-reduced balanced rooted trees:

(oooooooooo)

((ooooo)(ooooo))

((oooo)(oooooo))

((ooo)(ooooooo))

((oo)(oooooooo))

((ooo)(ooo)(oooo))

((oo)(oooo)(oooo))

((oo)(ooo)(ooooo))

((oo)(oo)(oooooo))

((oo)(oo)(ooo)(ooo))

((oo)(oo)(oo)(oooo))

((oo)(oo)(oo)(oo)(oo))

(((oo)(ooo))((oo)(ooo)))

(((oo)(oo))((ooo)(ooo)))

(((oo)(oo))((oo)(oooo)))

(((oo)(oo))((oo)(oo)(oo)))

(End)

STATUS

approved

editing

#5 by Alois P. Heinz at Fri Jan 29 21:42:40 EST 2016
STATUS

editing

approved