Each c(i) is "multiply" (*) or "divide" (/); d(1) = 1 < d(2) < ... < d(m) = n are the divisors of n; a(n) is number of choices for c(1), ..., c(m-1) so that d(1) c(1) d(2) c(2) d(3), .., c(m-1) d(m) is an integer.

A060448

Each c(i) is "multiply" (*) or "divide" (/); d(1) = 1 < d(2) < ... < d(m) = n are the divisors of n; a(n) is number of choices for c(1), ..., c(m-1) so that d(1) c(1) d(2) c(2) d(3), .., c(m-1) d(m) is an integer.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =5a(6) =1a(7) =5a(8) =2a(9) =5a(10) =1a(11) =13a(12) =1a(13) =5a(14) =5a(15) =9a(16) =1a(17) =13a(18) =1a(19) =13a(20) =5a(21) =5a(22) =1a(23) =62a(24) =2a(25) =5a(26) =5a(27) =13a(28) =1a(29) =59

External references