84546

Appears in sequences

• Number of proper T_1-hypergraphs with 3 labeled nodes and n hyperedges.at n=22A056078
• Number of permutations of floor(i*9/4), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=8A147941
• Number of permutations of floor(i*9/4), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=8A147950
• Triangle read by rows: number of set partitions of n elements with k connectors, 0<=k<n.at n=57A185982
• Number of set partitions of [n] having exactly two pairs (m,m+1) such that m is in some block b and m+1 is in block b+1.at n=9A271789