Triangle read by rows: T(n,k) is the number of (unlabeled) connected graphs with n nodes and metric dimension k, 0 <= k < n.
A348600
Triangle read by rows: T(n,k) is the number of (unlabeled) connected graphs with n nodes and metric dimension k, 0 <= k < n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =4a(9) =1a(10) =0a(11) =1a(12) =13a(13) =6a(14) =1a(15) =0a(16) =1a(17) =62a(18) =39a(19) =9a(20) =1a(21) =0a(22) =1a(23) =275a(24) =488a(25) =77a(26) =11a(27) =1a(28) =0a(29) =1
External references
- oeis: A348600