The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A036656

Number of n-node rooted unlabeled trees with outdegree <= 2 and exactly 1 edge at the root.
(history; published version)

#15 by Joerg Arndt at Sun Jun 12 03:00:12 EDT 2022

STATUS

reviewed

approved

#14 by Michel Marcus at Sun Jun 12 01:10:07 EDT 2022

STATUS

proposed

reviewed

#13 by Jon E. Schoenfield at Sun Jun 12 00:55:18 EDT 2022

STATUS

editing

proposed

#12 by Jon E. Schoenfield at Sun Jun 12 00:55:15 EDT 2022

NAME

Number of n-node rooted unlabeled trees with out-degree outdegree <= 2 and exactly 1 edge at the root.

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing

#11 by Bruno Berselli at Wed Jan 24 03:19:14 EST 2018

STATUS

proposed

approved

#10 by Jean-François Alcover at Wed Jan 24 03:18:12 EST 2018

STATUS

editing

proposed

#9 by Jean-François Alcover at Wed Jan 24 03:17:09 EST 2018

MATHEMATICA

terms = 33; A[_] = 0; Do[A[x_] = x + (1/2)*(A[x]^2 + A[x^2]) + O[x]^terms // Normal, terms];

CoefficientList[A[x] - x, x] (* Jean-François Alcover, Jan 24 2018 *)

STATUS

approved

editing

#8 by Russ Cox at Fri Mar 30 16:47:42 EDT 2012

AUTHOR

_N. J. A. Sloane (njas(AT)research.att.com)_.

Discussion

Fri Mar 30

16:47

OEIS Server: https://oeis.org/edit/global/110

#7 by Russ Cox at Sun Jul 10 18:22:40 EDT 2011

LINKS

<a href="/Sindx_index/Ro.html#rooted">Index entries for sequences related to rooted trees</a>

Discussion

Sun Jul 10

18:22

OEIS Server: https://oeis.org/edit/global/79

#6 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010

LINKS

<a href="/Sindx_Ro.html#rooted">Index entries for sequences related to rooted trees</a>

KEYWORD

nonn,new

nonn