a(1) = 1; for n >= 1, replace each part, with repetitions, of every part k in each partition of n with a(k), then take the sum to get a(n+1).
A096770
a(1) = 1; for n >= 1, replace each part, with repetitions, of every part k in each partition of n with a(k), then take the sum to get a(n+1).
Terms
- a(0) =1a(1) =1a(2) =3a(3) =8a(4) =21a(5) =51a(6) =127a(7) =303a(8) =734a(9) =1751a(10) =4200a(11) =10004a(12) =23918a(13) =56981a(14) =135958a(15) =323996a(16) =772530a(17) =1840993a(18) =4388456a(19) =10458354a(20) =24926754a(21) =59405383a(22) =141581236a(23) =337417607a(24) =804153140a(25) =1916469872a(26) =4567399008a(27) =10885108498a(28) =25941679513a(29) =61824709789
External references
- oeis: A096770