a(n) = number of partitions of d(n) into d(k)'s, where the k's are each <= n and distinct, but the d(k)'s need not be distinct. Here d(m) = the number of divisors of m.

A175108

a(n) = number of partitions of d(n) into d(k)'s, where the k's are each <= n and distinct, but the d(k)'s need not be distinct. Here d(m) = the number of divisors of m.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =3a(5) =5a(6) =4a(7) =9a(8) =6a(9) =11a(10) =5a(11) =37a(12) =6a(13) =21a(14) =22a(15) =33a(16) =7a(17) =88a(18) =8a(19) =117a(20) =36a(21) =37a(22) =9a(23) =533a(24) =12a(25) =47a(26) =48a(27) =200a(28) =10a(29) =898

External references