688850

Appears in sequences

• Triangle read by rows: T(n,k) = number of chiral pairs of color patterns (set partitions) in a row of length n using exactly k colors (subsets).at n=70A320525
• Number of chiral pairs of color patterns (set partitions) in a row of length n using exactly 5 colors (subsets).at n=11A320528
• Let m(k) be the index of the largest triangular number <= k; then a(n) is the smallest number k that can be written as the sum of three triangular numbers if the largest is the (m(k)-n)-th triangular number, but no larger.at n=24A331753