27950

Appears in sequences

• a(n) = (n/2)*(n + 1)*(3*n + 11).at n=24A059997
• Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).at n=24A071861
• Fifth column of (1,5)-Pascal triangle A096940.at n=23A096942
• F(n)_n where F() = Fibonacci numbers A000045.at n=18A122633
• Number of ways to place 2 queens on an n X n chessboard so that they attack each other.at n=25A144945
• Number of ways to partition an n X 6 grid into 6 connected equal-area regions.at n=4A167254
• T(n,m) = Number of ways to partition an nXm grid into 6 connected equal-area regions.at n=49A167262
• T(n,m) = Number of ways to partition an nXm grid into 6 connected equal-area regions.at n=50A167262
• Number of tilings of a 5 X n rectangle with n pentominoes of any shape.at n=6A174249
• Convolution of primes with odd primes.at n=24A209403
• Number A(n,k) of tilings of a k X n rectangle using pentominoes of any shape; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=71A233427
• Number A(n,k) of tilings of a k X n rectangle using pentominoes of any shape; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=72A233427
• Number of tilings of a 6 X 5n rectangle with 6n pentominoes of any shape.at n=1A233430
• a(n) = (Sum_{k=0..n-1} C(n-1,k)^2*C(-n-1,k)^2/C(k+2,2))/n.at n=5A246875
• Triangle A106534 with reversed rows.at n=57A280470
• Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n pegs from one outer vertex to another outer vertex, moving pegs to adjacent vertices, following the rules of the Towers of Hanoi.at n=43A291876
• Triangle T(n,k) (n >= k >= 0) read by rows: T(n,0) = (1+(-1)^n)/2; for k>=1, set T(0,k) = 0, S(n,k) = binomial(n,k)*binomial(n+k+1,k), and for n>=1, T(n,k) = S(n,k)-T(n-1,k).at n=58A331432
• The smallest of 3 consecutive integers such that the first is divisible by the square of a prime, the second is divisible by the cube of a prime, and the third is divisible by the fourth power of a prime.at n=18A349952
• a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly 2 ways, or -1 if no such number exists.at n=42A374287