193248

Appears in sequences

• a(n) = 2*(A056855(n)) /(phi(n)*n), where phi() is the Euler phi function.at n=10A099940
• Triangle read by rows: Hultman numbers: a(n,k) is the number of permutations of n elements whose cycle graph (as defined by Bafna and Pevzner) contains k cycles for n >= 0 and 1 <= k <= n+1.at n=46A164652
• Triangle T(n,k) read by rows: coefficients (in compressed forms) in order of decreasing exponents of polynomials p_n(t) related to Hultman numbers.at n=29A185263
• Numbers divisible by at least five of their digits, different and >1.at n=53A187533
• a(n) is the number of permutations p of {1,..,n} such that the minimum number of block interchanges required to sort the permutation p to the identity permutation is maximized.at n=9A260695