Triangle read by rows: T(n,k) is the number of nodes of degree k counted over all simple labeled graphs on n nodes, n>=1, 0<=k<=n-1.

A285529

Triangle read by rows: T(n,k) is the number of nodes of degree k counted over all simple labeled graphs on n nodes, n>=1, 0<=k<=n-1.

Terms

    a(0) =1a(1) =2a(2) =2a(3) =6a(4) =12a(5) =6a(6) =32a(7) =96a(8) =96a(9) =32a(10) =320a(11) =1280a(12) =1920a(13) =1280a(14) =320a(15) =6144a(16) =30720a(17) =61440a(18) =61440a(19) =30720a(20) =6144a(21) =229376a(22) =1376256a(23) =3440640a(24) =4587520a(25) =3440640a(26) =1376256a(27) =229376a(28) =16777216a(29) =117440512

External references