280200domain: NAppears in sequencesNumber of self-avoiding walks on hexagonal lattice, with additional constraints.at n=7A007200Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph is either a tree or a cycle.at n=43A144163