30888

Appears in sequences

• Degrees of irreducible representations of Fischer group Fi23.at n=5A003914
• Number of projective meanders.at n=12A006663
• a(n) = 6*(2*n+1)! / ((n!)^2*(n+3)).at n=7A007946
• Even numbers to the right of the central numbers of the (1,2)-Pascal triangle A029635.at n=37A029643
• Even numbers to the left of the central elements of the (2,1)-Pascal triangle A029653.at n=42A029665
• Positive numbers k such that (k+1)*(k+2)*(k+3)*(k+4)/(k+(k+1)+(k+2)+(k+3)+(k+4)) is an integer.at n=30A032795
• a(n) = binomial(n+6,6)*(2n+7)/7.at n=10A050486
• Eighth column of quintinomial coefficients.at n=10A064057
• Numbers k not in A065036 but such that tau(k) = omega(k)^3.at n=30A074853
• Table by antidiagonals giving variants on Catalan sequence: T(n,k)=C(2n,n)*C(2k,k)*(2k+1)/(n+k+1).at n=47A078817
• Triangle read by rows: number of order-preserving partial transformations (of an n-element chain) of width and waist both equal to r (width(alpha) = |Dom(alpha)| and waist(alpha) = max(Im(alpha))).at n=53A110858
• Consider n x n chessboard. This sequence gives number of chess knight paths from left bottom corner of the board to the right top corner with minimal possible path length (shortest paths).at n=20A120399
• Triangle T(n,k) = binomial(2*n-k, k)*(n-k)!, read by rows.at n=50A155856
• Triangle T(n, k) = binomial(n+k, 2*k)*k!, read by rows.at n=49A156367
• a(n) = (n + 4)*(n + 3)*(n + 2)*(n + 1)*n / 5 = 24*A000389(n+4).at n=9A158874
• Numbers with exactly 64 divisors.at n=35A172443
• Where A174102 sets a new record.at n=33A173570
• Convolution square of A058187, the tetrahedral series with repeats.at n=20A178440
• Numbers with prime factorization p*q*r^3*s^3 (where p, q, r, s are distinct primes).at n=11A190108
• Number of nX2 arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nX2 array.at n=5A218175