617400

Appears in sequences

• Number of Hamiltonian paths in K_5 X P_n.at n=2A003750
• a(n) is the smallest number representable in exactly n ways as a sum of 2 powerful(1) numbers.at n=29A115354
• Triangle read by rows: T(n,k) = binomial(n,k)*(binomial(n-1,k-1)*binomial(n+1,k+1) + binomial(n-1,k)*binomial(n+1,k)), with T(0,0) = 1.at n=40A174148
• Number of (n+2)X5 binary arrays avoiding patterns 001 and 011 in rows and columns.at n=6A202095
• Number of (n+2)X9 binary arrays avoiding patterns 001 and 011 in rows and columns.at n=2A202099
• Number of (n+1)X(4+1) 0..1 arrays with nondecreasing sum of every two consecutive values in every row and column.at n=7A250428
• Triangle read by rows: T(n,k) = (n-1)!*n^(k-1)*binomial(n,k)/(k-1)!.at n=23A256215
• Numbers n such that n^k is the sum of a positive square and a positive cube for all k not divisible by 6.at n=4A274247
• Number of 5-cycles in the n-triangular honeycomb queen graph.at n=12A289706
• Numbers having exactly four non-unitary prime factors.at n=32A338541
• a(n) = (1/2) * Sum_{k=1..n} (n+k)! / k!.at n=5A384929
• a(n) is the least number that has exactly n exponential abundant divisors.at n=12A389299