Search Results for ""

There are a number of attractive polyhedron compounds consisting of 13 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 25 octahedra. These compounds will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 30 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 35 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of six octahedra. The two illustrated above can be constructed as the duals of cube 6-compounds. These ...

There are a number of attractive polyhedron compounds consisting of seven octahedra. The compound illustrated above can be constructed as the dual of cube 7-compound. The ...

There are a number of attractive polyhedron compounds consisting of nine octahedra. The compound illustrated above can be constructed as the dual of cube 9-compound. The ...

The number of nondecreasing lists {a_1,a_2,...,a_n} consisting of n elements 1<=a_i<=k is given by the binomial coefficient N(n,k)=(n+k-1; n-1). For example, there are six ...

A permutation of n distinct, ordered items in which none of the items is in its original ordered position is known as a derangement. If some, but not necessarily all, of the ...

The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...