Triangle read by rows: T(n,k) is the number of graphs with n vertices and arboricity k (n >= 1, 1 <= k <= ceiling(n/2)).

A294218

Triangle read by rows: T(n,k) is the number of graphs with n vertices and arboricity k (n >= 1, 1 <= k <= ceiling(n/2)).

Terms

    a(0) =1a(1) =2a(2) =3a(3) =1a(4) =6a(5) =5a(6) =10a(7) =22a(8) =2a(9) =20a(10) =114a(11) =22a(12) =37a(13) =703a(14) =300a(15) =4a(16) =76a(17) =5946a(18) =6204a(19) =120a(20) =153a(21) =68505a(22) =198406a(23) =7595a(24) =9a(25) =329a(26) =1042310a(27) =9901453a(28) =1060264a(29) =812

External references