The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A124343 Number of rooted trees on n nodes with thinning limbs. 13
 1, 1, 2, 3, 6, 10, 21, 38, 78, 153, 314, 632, 1313, 2700, 5646, 11786, 24831, 52348, 111027, 235834, 502986, 1074739, 2303146, 4944507, 10639201, 22930493, 49511948, 107065966, 231874164, 502834328, 1091842824, 2373565195, 5165713137, 11254029616, 24542260010 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A rooted tree with thinning limbs is such that if a node has k children, all its children have at most k children. LINKS Alois P. Heinz, Table of n, a(n) for n = 1..141 EXAMPLE The a(5) = 6 trees are ((((o)))), (o((o))), (o(oo)), ((o)(o)), (oo(o)), (oooo). - Gus Wiseman, Jan 25 2018 MAPLE b:= proc(n, i, h, v) option remember; `if`(n=0,       `if`(v=0, 1, 0), `if`(i<1 or v<1 or n A(n\$2): seq(a(n), n=1..35);  # Alois P. Heinz, Jul 08 2014 MATHEMATICA b[n_, i_, h_, v_] := b[n, i, h, v] = If[n==0, If[v==0, 1, 0], If[i<1 || v<1 || n

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 15:57 EST 2020. Contains 338929 sequences. (Running on oeis4.)