The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A055291

Number of trees with n nodes and 4 leaves.
(history; published version)

#12 by Peter Luschny at Mon Mar 07 10:22:22 EST 2022

STATUS

reviewed

approved

#11 by Joerg Arndt at Mon Mar 07 09:39:25 EST 2022

STATUS

proposed

reviewed

#10 by Georg Fischer at Mon Mar 07 08:51:01 EST 2022

STATUS

editing

proposed

#9 by Georg Fischer at Mon Mar 07 08:48:46 EST 2022

LINKS

Georg Fischer, <a href="/A055291/b055291.txt">Table of n, a(n) for n = 5..250</a>

STATUS

approved

editing

Discussion

Mon Mar 07

08:51

Georg Fischer: Computed with the PARI in A055290, for the comparision of the o.g.f.s. Same for A055292-299.

#8 by Russ Cox at Fri Mar 30 17:37:10 EDT 2012

AUTHOR

_Christian G. Bower (bowerc(AT)usa.net), _, May 09 2000

Discussion

Fri Mar 30

17:37

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

#7 by Russ Cox at Sun Jul 10 18:21:31 EDT 2011

LINKS

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

Discussion

Sun Jul 10

18:21

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

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

LINKS

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

KEYWORD

nonn,new

nonn

#5 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009

LINKS

<a href="http://www.research.att.com/~njas/sequences/Sindx_Tra.html#trees">Index entries for sequences related to trees</a>

KEYWORD

nonn,new

nonn

#4 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004

FORMULA

G.f.: x^5(x^5+x^3+1)/[(1-x^3)(1+x^2)(1-x^2)^2(1-x)^2].

KEYWORD

nonn,new

nonn

#3 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004

NAME

Trees Number of trees with n nodes and 4 leaves.

KEYWORD

nonn,new

nonn