Triangle read by rows: T(n,k) is the number of (unlabeled) connected graphs with n nodes such that k is the maximum number that can be reached when the stepping stone puzzle of A337663 is played on the graph, 1 <= k <= n.
A350785
Triangle read by rows: T(n,k) is the number of (unlabeled) connected graphs with n nodes such that k is the maximum number that can be reached when the stepping stone puzzle of A337663 is played on the graph, 1 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =0a(4) =2a(5) =0a(6) =0a(7) =4a(8) =2a(9) =0a(10) =0a(11) =4a(12) =12a(13) =5a(14) =0a(15) =0a(16) =4a(17) =34a(18) =53a(19) =21a(20) =0a(21) =0a(22) =4a(23) =69a(24) =244a(25) =421a(26) =115a(27) =0a(28) =0a(29) =4
External references
- oeis: A350785