48552

Appears in sequences

• Number of positions that are exactly n moves from the starting position in the Bicube or Bandaged Rubik's Cube puzzle.at n=15A079771
• Number of 3 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.at n=27A086113
• Least K such that K*(prime(100*n)^(100*n))-1 is prime with prime(n)=n-th prime.at n=10A129245
• Number of n X n arrays of squares of integers summing to 35 with every element equal to at least one neighbor.at n=2A146550
• B(n,k) an additive decomposition of (4^n-2^n)*B(n), B(n) the Bernoulli numbers (triangle read by rows).at n=30A154345
• Number of n X n 0..3 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=2A203093
• Number of nX3 0..3 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=2A203096
• T(n,k) = number of nXk 0..3 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=12A203101
• Triangle read by rows: T(n,k) = ((Stirling2)^2)(n,k) * k!at n=23A233357
• Consider primitive pairs of integers (b, c) with b < 0 such that x^5 + b*x + c = 0 is irreducible and solvable by radicals: sequence gives values of c.at n=17A371558
• Triangle read by rows: T(n,k) is the number of endofunctions on [n] where the difference between the smallest and largest values in the image of the function is k, 0 <= k < n.at n=24A391488