215296

Appears in sequences

• Expansion of Product_{k>=1} (1-x^k)^32.at n=7A010837
• a(n) = (12*n + 8)^2.at n=38A017618
• Smallest number k such that n! + k is a square.at n=14A068869
• On a 3 X 3 board, the number of n-move paths for a chess king ending in a given corner square.at n=8A086346
• Numbers k such that A094471(k) is prime.at n=37A096847
• a(n) = ((n+1)*(2*n-1))^2.at n=15A123198
• a(n) = (29*n)^2.at n=16A133496
• Numbers of the form p^8*q^2 where p and q are distinct primes.at n=10A179699
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=15A208066
• Number of (n+2)X(3+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=3A230972
• Number of (n+2) X (4+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=2A230973
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=17A230977
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=18A230977
• Least number k >= 0 such that n! + k is a perfect power.at n=14A240939
• The distance between n! and the nearest perfect square.at n=15A260374
• Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 with each element having directed index change 0,0 0,2 1,0 or -1,-2.at n=2A264363
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,2 1,0 or -1,-2.at n=38A264364
• Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,0 0,2 1,0 or -1,-2.at n=6A264367
• Squares that become prime when their rightmost digit is removed.at n=35A265211
• a(n) is the least k such that phi(k) + d(k) = A357916(n), where phi(k) = A000010(k) is Euler's totient function, and d(k) = A000005(k) is the number of divisors of k.at n=42A357917