594000

Appears in sequences

• Triangle read by rows: T(n,k) = count of increasing runs in two concatenated k-permutations of [n].at n=18A122823
• Define the array k(n,x) = number of m such that tau(gcd(n,m)) is x where m runs from 1 to n. Also define h(n,x) = Sum_{d|n : tau(d) = x} d. The sequence contains numbers n such that k(n,x)*x = h(n,x) has at least one solution x.at n=29A197099
• a(n) is the sum of the entries in an n X n X n 3D matrix whose elements start at 1 in the corner cells and increase by 1 with each step towards the center.at n=29A350236