Number of sets (in the Hausdorff metric geometry) at each location between two sets defined by a complete bipartite graph K(3,n) (with n at least 2) missing one edge.
A335608
Number of sets (in the Hausdorff metric geometry) at each location between two sets defined by a complete bipartite graph K(3,n) (with n at least 2) missing one edge.
Terms
- a(0) =8a(1) =104a(2) =896a(3) =6800a(4) =49208a(5) =349304a(6) =2459696a(7) =17261600a(8) =120962408a(9) =847130504a(10) =5931094496a(11) =41521204400a(12) =290659059608
External references
- oeis: A335608