Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with circumference k, (n >= 3, k >= 3).
A325455
Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with circumference k, (n >= 3, k >= 3).
Terms
- a(0) =1a(1) =1a(2) =3a(3) =4a(4) =6a(5) =8a(6) =10a(7) =24a(8) =24a(9) =48a(10) =30a(11) =87a(12) =116a(13) =226a(14) =383a(15) =83a(16) =342a(17) =527a(18) =1283a(19) =2663a(20) =6196a(21) =257a(22) =1324a(23) =2644a(24) =6644a(25) =17613a(26) =55468a(27) =177083
External references
- oeis: A325455