334656

Appears in sequences

• Triangle 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=50A144163
• Number of permutations of {1,...,n} avoiding adjacent step pattern up, down, up, up, up.at n=9A177530
• Number of 6-cycles in the n-triangular graph.at n=7A290940
• Numbers representable as truncated triangular numbers A008912 in more ways than any smaller number.at n=8A322491