Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....
A089435
Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....
Terms
- a(0) =1a(1) =3a(2) =1a(3) =13a(4) =8a(5) =2a(6) =66a(7) =60a(8) =25a(9) =5a(10) =367a(11) =442a(12) =255a(13) =84a(14) =14a(15) =2164a(16) =3248a(17) =2380a(18) =1064a(19) =294a(20) =42a(21) =13293a(22) =23904a(23) =21192a(24) =11832a(25) =4410a(26) =1056a(27) =132a(28) =84157a(29) =176397
External references
- oeis: A089435