29215

Appears in sequences

• A symmetrical triangle T(n, m) = 2*Eulerian(n+1, m) -1, read by rows.at n=38A176200
• A symmetrical triangle T(n, m) = 2*Eulerian(n+1, m) -1, read by rows.at n=42A176200
• a(n) = (1/4)*(5*(n-1)*P(n)+n*P(n-1)) where P() are the Pell numbers A000129.at n=9A187917
• a(n) = (p-1)! mod p^3, where p = prime(n).at n=22A330526
• Number of words covering the alphabet [n] that are irreducible with respect to C, with |C| = 1.at n=6A390275
• Triangle read by rows: T(n,k) is the number of irreducible words covering the alphabet [n] such that the maximal cardinality of C is k, where C is a subset of the alphabet such that all letters in C appear in weakly increasing order within the word.at n=29A390670