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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A220233 Triangular array read by rows.  T(n,k) is the number of labeled rooted trees of height at most 2 with exactly k leaves at a distance 1 from the root, n>=1, 0<=k<=n-1. 0

%I

%S 0,0,2,6,0,3,12,24,0,4,80,60,60,0,5,390,480,180,120,0,6,2352,2730,

%T 1680,420,210,0,7,15176,18816,10920,4480,840,336,0,8,106416,136584,

%U 84672,32760,10080,1512,504,0,9,801450,1064160,682920,282240,81900,20160,2520,720,0,10

%N Triangular array read by rows. T(n,k) is the number of labeled rooted trees of height at most 2 with exactly k leaves at a distance 1 from the root, n>=1, 0<=k<=n-1.

%C Row sums = A052512 for n>1. Column for k=0 is A220232.

%F E.g.f.: x*(exp(x*(exp(x) -1 + y)) - 1 + y) (letting T(1,1)=1).

%e 0,

%e 0, 2,

%e 6, 0, 3,

%e 12, 24, 0, 4,

%e 80, 60, 60, 0, 5,

%e 390, 480, 180, 120, 0, 6,

%e 2352, 2730, 1680, 420, 210, 0, 7}

%t nn=7;f[list_]:=Select[list,#>0&];a=x (Exp[x]-1+y);Prepend[Drop[Map[Insert[#,0,-2]&,Map[f,Range[0,nn]!CoefficientList[Series[x (Exp[a]-1+y),{x,0,nn}],{x,y}]]],2],{0}]//Grid

%K nonn,tabl

%O 1,3

%A _Geoffrey Critzer_, Dec 08 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 21:17 EDT 2021. Contains 348065 sequences. (Running on oeis4.)