279312

Appears in sequences

• a(n) = n*(n + 1)*(n^2 + n + 2)/4.at n=32A001621
• Coordination sequence for A_32 lattice.at n=2A035858
• a(n) = n*(n-1)^2*(n-2).at n=22A047928
• Number of binary trees of path length n.at n=43A095830
• a(n) = (n-th prime)^4-(n-th prime)^2.at n=8A138402
• Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=4A162810
• Oblong numbers that are the product of two oblong numbers.at n=27A188660
• Oblong numbers the product of whose digits are positive oblong numbers.at n=21A285079
• a(n) is the number of ways to split [n] = {1,2,...,n} into two (possibly empty) complementary intervals {1,2,...,i} and {i+1,i+2,...,n} and then, if both intervals are nonempty, select 2 nonempty blocks/cells (i.e., subintervals) from each of them, or if one of the intervals is empty, select 2 nonempty blocks/cells from the nonempty interval.at n=32A353232
• Oblong numbers that are products of smaller oblong numbers.at n=37A374374
• The second Jordan totient function applied to the powerful numbers: a(n) = A007434(A001694(n)).at n=38A379716
• The second Jordan totient function applied to the squares.at n=22A379833