a(0) = a(1) = 1; a(n+1) is the number of partitions of n into parts a(k), 0 <= k <= n, each k occurring at most once.

A057601

a(0) = a(1) = 1; a(n+1) is the number of partitions of n into parts a(k), 0 <= k <= n, each k occurring at most once.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =2a(4) =4a(5) =4a(6) =6a(7) =8a(8) =10a(9) =11a(10) =12a(11) =14a(12) =17a(13) =21a(14) =25a(15) =29a(16) =33a(17) =37a(18) =43a(19) =49a(20) =54a(21) =59a(22) =66a(23) =72a(24) =80a(25) =89a(26) =98a(27) =106a(28) =116a(29) =126

External references