2731135
domain: N
Appears in sequences
- Triangle t(n,m) read by rows: t(n,m) = binomial(2^n-1, 2^m-1) if n >= 2*m, otherwise symmetrically extended t(n,m) = t(n,n-m).at n=38A176791
- The number of inequivalent ways to color the vertices of a regular octahedron using at most n colors.at n=21A198833
- Squarefree tetrahedral numbers which are products of five distinct primes.at n=18A354976