68303

Appears in sequences

• A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct.at n=30A096772
• Triangle read by rows: number of labeled partitions of n with maximin m.at n=60A113547
• Partial sums of A032598.at n=22A129330
• Triangle read by rows: T(n,m), n >= 1, 1 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}.at n=49A362924
• Triangle read by rows: T(n,m), n >= 0, 0 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}.at n=60A362925
• Triangle read by rows: A113547 without its main diagonal.at n=50A362926
• Number of partitions of [2n] that have at most one block contained in [n].at n=5A367820
• a(n) = Sum_{k=0..n} (k+1)^5 * Stirling2(n,k).at n=5A383054