44525

Appears in sequences

• Graham-Sloane-type lower bound on the size of a ternary (n,3,6) constant-weight code.at n=13A030506
• Number of steps to factor n!-1 using Fermat's factorization method.at n=13A093082
• Least sum (n+1) + (n+2) + ... + (n+k) that is a multiple of the n-th triangular number, n(n+1)/2.at n=24A110351
• a(n) = n*(n + 1)*(17*n - 14)/6.at n=25A237617
• Number of (n+1) X (3+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=4A250893
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=25A250898
• Number of (5+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=2A250903
• Number of n X (n+5) arrays of permutations of n+5 copies of 0..n-1 with every element equal to or 1 greater than any north, southwest or northwest neighbors modulo n and the upper left element equal to 0.at n=5A267201
• Number of 6Xn arrays containing n copies of 0..6-1 with every element equal to or 1 greater than any north, southwest or northwest neighbors modulo 6 and the upper left element equal to 0.at n=10A267204