65835

Appears in sequences

• Triangle of numbers related to triangle A049213; generalization of Stirling numbers of second kind A008277, Bessel triangle A001497.at n=15A000369
• Degrees of irreducible representations of Harada-Norton group HN.at n=12A003915
• Degrees of irreducible representations of Harada-Norton group HN.at n=13A003915
• Quadruple factorial numbers n!!!!: a(n) = n*a(n-4).at n=19A007662
• Quadruple factorial numbers: Product_{k=0..n-1} (4*k + 3).at n=5A008545
• Numbers whose base-16 representation has exactly 5 runs.at n=25A043678
• a(n) = 9*binomial(n,4) = 3*n*(n-1)*(n-2)*(n-3)/8.at n=22A060008
• Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the leftmost child of the root has degree k.at n=38A101401
• Partition number array, called M32(-3), related to A000369(n,m) = |S2(-3;n,m)| (generalized Stirling triangle).at n=18A143173
• Partition number array, called M32hat(-3)= 'M32(-3)/M3'= 'A143173/A036040', related to A000369(n,m)= |S2(-3;n,m)| (generalized Stirling triangle).at n=18A144279
• Partition number array, called M32hat(-3)= 'M32(-3)/M3'= 'A143173/A036040', related to A000369(n,m)= |S2(-3;n,m)| (generalized Stirling triangle).at n=30A144279
• Partition number array, called M32hat(-3)= 'M32(-3)/M3'= 'A143173/A036040', related to A000369(n,m)= |S2(-3;n,m)| (generalized Stirling triangle).at n=49A144279
• Lower triangular array called S2hat(-3) related to partition number array A144279.at n=15A144280
• Triangle T(n, k) = Product_{j=0..k} (j*n + prime(m)), with T(n, 0) = prime(m) and m = 2, read by rows.at n=14A153270
• Triangle read by rows: T(n,k) is the number of end rhyme patterns of a poem of an even number of lines (2n) with 1<=k<=n evenly rhymed sounds.at n=18A156289
• A partition product of Stirling_2 type [parameter k = 3] with biggest-part statistic (triangle read by rows).at n=20A157403
• Triangle T(n,m) read by rows: The number of m-Schroeder paths of order n with 2 diagonal steps.at n=12A173622
• Least k such that 2^x + k produces primes for x=1..n and composite for x=n+1.at n=6A193109
• Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.at n=15A225471
• Triangle read by rows, 4^k*s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.at n=15A225478