816816

Appears in sequences

• a(n) = 7*(n+1)*binomial(n+6,7)/2.at n=10A027819
• a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).at n=16A068629
• a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).at n=17A068629
• Nontrivial numbers k containing no zero digits which are divisible by the number formed by writing the digits of k in ascending order.at n=5A084687
• a(n) = 42*binomial(n,10).at n=17A088626
• Inverse of Riordan array (1/(1-x), x/(1-x)^4), A109960.at n=48A109962
• a(n) = denominator of the sum of reciprocals of the terms in n-th row of triangle A077581.at n=18A126578
• Denominator of the polynomial A_l(x) = sum_{d=1..l-1} x^(l-d)/d for index l=2n+1 evaluated at x=15.at n=8A145636
• Numbers with prime factorization pqrstu^4.at n=22A190388
• Number of 5-bead necklaces of n colors not allowing reversal, with no adjacent beads having the same color.at n=21A208536
• a(n) = 132*binomial(n,12).at n=17A213380
• Number of permutations of 0..floor((n*3-1)/2) on even squares of an n X 3 array such that each row and column of even squares is increasing.at n=10A215287
• Number T(n,k) of length 2n k-ary words, either empty or beginning with the first letter of the alphabet and using each letter at least once, that can be built by repeatedly inserting doublets into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=33A256116
• Triangle read by rows: T(n,k) = binomial(2*n+1, 2*k+1)*binomial(2*n-2*k, n-k)/(n+1-k) for 0 <= k <= n.at n=38A281000
• Triangle read by rows: T(n,k) = binomial(2*n+1, 2*k+1)*binomial(2*n-2*k, n-k)/(n+1-k) for 0 <= k <= n.at n=39A281000
• a(n) = (1/3)*(n+2)^2*(3*n+3)!/(n+2)!^3.at n=5A319578
• Non-palindromes numbers not ending in 0 whose square is the product of a number and its reverse in only one way.at n=24A325151
• T(n, k) = (n + k - 1)*(n + k)*binomial(2*n + 1, n - k + 1) with T(0, 0) = T(1, 0) = 1. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=40A342313
• Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) = c_n * F(k)/F(k+2) where c_n = LCM of F(3), F(4), ... F(n+2) (and F() are the Fibonacci numbers).at n=30A374667