VOOZH about

URL: https://oeis.org/history?seq=A124500

⇱ The On-Line Encyclopedia of Integer Sequences (OEIS)


login

Showing all changes.
Number of 1-2-3-4-5 trees with n edges and with thinning limbs. A 1-2-3-4-5 tree is an ordered tree with vertices of outdegree at most 5. A rooted tree with thinning limbs is such that if a node has k children, all its children have at most k children.
#6 by Joerg Arndt at Sun Oct 06 13:58:42 EDT 2013
STATUS
#5 by Joerg Arndt at Sun Oct 06 13:58:39 EDT 2013
PROG
STATUS
#4 by Jon E. Schoenfield at Sun Oct 06 13:45:20 EDT 2013
STATUS
#3 by Jon E. Schoenfield at Sun Oct 06 13:45:18 EDT 2013
PROG
AUTHOR
STATUS
#2 by N. J. A. Sloane at Sat Nov 10 03:00:00 EST 2007
PROG
KEYWORD
#1 by N. J. A. Sloane at Wed Dec 06 03:00:00 EST 2006
NAME
DATA
OFFSET
COMMENTS
FORMULA
PROG
CROSSREFS
KEYWORD
AUTHOR
STATUS