63680

Appears in sequences

• Each c(i) is "multiply" (*) or "divide" (/). a(n) is number of choices for c(1), ..., c(n-1) so that 1 c(1) 2 c(2) 3,.., c(n-1) n is an integer.at n=23A058524
• a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is an oblong number.at n=37A214963
• Number of n X 3 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=7A279736
• T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=52A279741
• Number of multiset partitions of integer partitions of n where all parts have the same product.at n=36A320886
• Triangle read by rows: T(n,k) is the number of partitions of a 4-colored set of n objects into at most k parts with 0 <= k <= n.at n=49A382241