a(n) is the number of arrangements of all divisors of n of the form d_1=n, d_2, d_3,...,d_tau(n) such that every ratio d_(i+1)/d_i and d_tau(n)/d_1 is prime or 1/prime
0, 1, 1, 0, 1, 2, 1, 0, 0, 2, 1, 2, 1, 2, 2, 0, 1, 2, 1, 2, 2, 2, 1, 2, 0, 2, 0, 2, 1, 12, 1, 0, 2, 2
2 seqfan posts
Tue Aug 24 15:28:19 CEST 2010 [seqfan] A combinatorial problem: non-sorting algorithms for A179926 and A180026