Triangle read by rows: T(n,k) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces, n>=2, 0<=k<=floor(n/2)-1.
A094046
Triangle read by rows: T(n,k) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces, n>=2, 0<=k<=floor(n/2)-1.
Terms
- a(0) =1a(1) =4a(2) =22a(3) =1a(4) =141a(5) =15a(6) =988a(7) =171a(8) =3a(9) =7337a(10) =1778a(11) =77a(12) =56749a(13) =17758a(14) =1300a(15) =12a(16) =452332a(17) =173826a(18) =18315a(19) =435a(20) =3689697a(21) =1683055a(22) =233695a(23) =9680a(24) =55a(25) =30652931a(26) =16195344a(27) =2804637a(28) =171226a(29) =2574
External references
- oeis: A094046