623645

Appears in sequences

• Sextuple factorial numbers: Product_{k=0..n-1} (6*k + 5).at n=5A008543
• Triangle read by rows, the inverse Bell transform of n!*binomial(5,n) (without column 0).at n=15A013988
• Product of first n primes of form 6k-1.at n=4A057130
• Expansion of (1-x)^(-1)/(1 - 2*x - x^2 - x^3).at n=14A077849
• Sextuple factorials, 6-factorials, n!!!!!!, n!6.at n=29A085158
• a(n) = Product of k primes in arithmetic progression with common difference 6, otherwise a(n) = prime(n).at n=2A120313
• Sequence of pairs numerator(s(n)), denominator(s(n)) where s(n) is the n-th partial sum of 1/A119754(n).at n=11A120343
• Partition number array, called M32(-5), related to A013988(n,m)= |S2(-5;n,m)| ( generalized Stirling triangle).at n=18A144268
• Partition number array, called M32hat(-5)= 'M32(-5)/M3'= 'A144268/A036040', related to A011801(n,m)= |S2(-4;n,m)| (generalized Stirling triangle).at n=18A144341
• Partition number array, called M32hat(-5)= 'M32(-5)/M3'= 'A144268/A036040', related to A011801(n,m)= |S2(-4;n,m)| (generalized Stirling triangle).at n=30A144341
• Partition number array, called M32hat(-5)= 'M32(-5)/M3'= 'A144268/A036040', related to A011801(n,m)= |S2(-4;n,m)| (generalized Stirling triangle).at n=49A144341
• Lower triangular array called S2hat(-5) related to partition number array A144341.at n=15A144342
• Triangle sequence: T(n, k) = -Product_{j=0..k+1} ((n+1)*j - 1).at n=19A153187
• Triangle T(n, k) = Product_{j=0..k} (j*n + prime(m)), with T(n, 0) = prime(m) and m = 3, read by rows.at n=25A153271
• Triangle read by rows: T(n,k) = Product_{i=0..k-2} (i*n + n - 1).at n=14A153273
• A partition product of Stirling_2 type [parameter k = 5] with biggest-part statistic (triangle read by rows).at n=20A157405
• a(1) = least k such that 1/2 + 1/3 < H(k) - H(3); a(2) = least k such that H(a(1)) - H(3) < H(k) -H(a(1)), and for n > 2, a(n) = least k such that H(a(n-1)) - H(a(n-2)) > H(k) - H(a(n-1)), where H = harmonic number.at n=12A227653
• Squarefree products of k primes that are symmetrically distributed around their average. Case k = 5.at n=5A294752
• a(n) = -(-n)^n * FallingFactorial(1/n, n) for n >= 1 and a(0) = -1.at n=6A349731