a(n) is the smallest k>=n such that the number of partitions of k is a multiple of n, or -1 if no such k exists.

A086146

a(n) is the smallest k>=n such that the number of partitions of k is a multiple of n, or -1 if no such k exists.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =11a(4) =7a(5) =9a(6) =10a(7) =11a(8) =14a(9) =19a(10) =12a(11) =21a(12) =28a(13) =19a(14) =24a(15) =66a(16) =54a(17) =21a(18) =20a(19) =58a(20) =24a(21) =25a(22) =32a(23) =70a(24) =44a(25) =28a(26) =39a(27) =55a(28) =91a(29) =97

External references