178939

Properties

Appears in sequences

• Coefficients for numerical differentiation.at n=9A002701
• Start of the first run of exactly n consecutive primes, none of which are twin primes.at n=34A065044
• Largest prime factor of the n-th central factorial number A001819(n).at n=8A120298
• As p runs through primes >= 5, sequence gives { numerator of Sum_{k=1..p-1} 1/k^2 } / p.at n=2A125551
• T(n,m) = Number of ways to partition an n X m grid into 9 connected equal-area regions.at n=60A167265
• Primes of the form 9n^2 + 10.at n=18A201708
• Number of tilings of a 6 X 2n rectangle with 3n tetrominoes of any shape.at n=3A232684
• Least prime p such that H(2,n) = sum_{k=1..n}1/k^2 == 0 (mod p) but there is no 0 < k < n with H(2,k) == 0 (mod p), or 1 if such a prime p does not exist.at n=9A242241
• Number of tilings of an 2n X 2n square using tetrominoes of any shape.at n=3A263425
• Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n^2) is the number of ways to tile an n X n chessboard with k rook-connected polyominoes of equal area.at n=63A348452
• Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= number of divisors of n^2) is the number of ways to tile an n X n chessboard with d_k rook-connected polyominoes of equal area, where d_k is the k-th divisor of n^2.at n=20A348453
• Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n^2) is the number of ways to tile an n X n chessboard with rook-connected polyominoes of area k.at n=58A348454
• Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= number of divisors of n^2) is the number of ways to tile an n X n chessboard with rook-connected polyominoes of area d_k, where d_k is the k-th divisor of n^2.at n=18A348455
• Prime numbersat n=16245