63600

Appears in sequences

• Number of free polyominoes (or square animals) with n cells.at n=12A000105
• Number of ways to place a non-attacking white and black knight on n X n chessboard.at n=15A035289
• Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= n).at n=77A125753
• Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= n).at n=102A125753
• Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= 1).at n=77A125761
• Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= 1).at n=102A125761
• Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)).at n=52A132883
• Numbers k such that k and k^2 use only the digits 0, 3, 4, 6 and 9.at n=33A136932
• Augmentation of the triangular array P=A094727 given by p(n,k)=n+k+1 for 0<=k<=n. See Comments.at n=23A193093
• Values of the difference d for 6 primes in arithmetic progression with the minimal start sequence {7 + j*d}, j = 0 to 5.at n=15A206040
• Values of the difference d for 7 primes in arithmetic progression with the minimal start sequence {7 + j*d}, j = 0 to 6.at n=7A206041
• Number of free polyominoes with 2n cells.at n=6A210996
• Expansion of ( f(-q)^12 + 22 * q * f(-q)^6 * f(-q^5)^6 + 125 * q^2 * f(-q^5)^12 ) / (f(-q) * f(-q^5))^2 in powers of q where f() is a Ramanujan theta function.at n=19A235870
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its west, northeast or southeast neighbor modulo n and the upper left element equal to 0.at n=25A267222
• a(n) = sqrt((x^2 - y^2)*x*y/c) where x is A364108(n), y is A364109(n) and c is A006991(n).at n=27A364110