[go: up one dir, main page]

login
Revision History for A052525 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of unlabeled rooted trees with n leaves in which the degrees of the root and all internal nodes are >= 3.
(history; published version)
#15 by N. J. A. Sloane at Tue Apr 18 07:03:25 EDT 2017
LINKS

INRIA Algorithms Project, <a href="http://algoecs.inria.fr/ecsservices/ecsstructure?searchType=1&amp;service=Search&amp;searchTermsnbr=95">Encyclopedia of Combinatorial Structures 95</a>

Discussion
Tue Apr 18
07:03
OEIS Server: https://oeis.org/edit/global/2632
#14 by Vaclav Kotesovec at Mon May 04 08:31:49 EDT 2015
STATUS

editing

approved

#13 by Vaclav Kotesovec at Mon May 04 08:31:38 EDT 2015
FORMULA

a(n) ~ c * d^n / n^(3/2), where d = 2.2318799173898687960533559522113115638..., c = 0.3390616344584879699709248904124... . - Vaclav Kotesovec, May 04 2015

#12 by Vaclav Kotesovec at Mon May 04 08:23:48 EDT 2015
LINKS

Vaclav Kotesovec, <a href="/A052525/b052525.txt">Table of n, a(n) for n = 0..1000</a>

STATUS

approved

editing

#11 by R. J. Mathar at Mon Sep 02 12:43:00 EDT 2013
STATUS

editing

approved

#10 by R. J. Mathar at Mon Sep 02 12:42:53 EDT 2013
EXTENSIONS

More terms from _Paul. Zimmermann(AT)loria.fr, _, Oct 31 2002

STATUS

approved

editing

#9 by Russ Cox at Fri Mar 30 16:48:44 EDT 2012
COMMENTS

Old name was "Non-planar unlabeled trees with neither unary nor binary nodes". I am leaving this alternative name here because it may help clarify the definitions of related sequences. - _N. J. A. Sloane (njas(AT)research.att.com)_.

Discussion
Fri Mar 30
16:48
OEIS Server: https://oeis.org/edit/global/110
#8 by Charles R Greathouse IV at Thu Dec 01 11:31:58 EST 2011
LINKS

INRIA Algorithms Project, <a href="http://algo.inria.fr/binecs/encyclopediaecs?searchType=1&amp;service=Search=ECSnb&amp;argsearchsearchTerms=95">Encyclopedia of Combinatorial Structures 95</a>

Discussion
Thu Dec 01
11:31
OEIS Server: https://oeis.org/edit/global/103
#7 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&amp;argsearch=95">Encyclopedia of Combinatorial Structures 95</a>

KEYWORD

easy,nonn,new

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

Old name was "Non-planar unlabeled trees with neither unary nor binary nodes". I am leaving this alternative name here because it may help clarify the definitions of related sequences. - N. J. A. Sloane (njas(AT)research.att.com).

KEYWORD

easy,nonn,new