Number of distinct positive integers that can be obtained by iteratively adding any two or multiplying any two non-1 parts of an integer partition until only one part remains, starting with 1^n.
A319909
Number of distinct positive integers that can be obtained by iteratively adding any two or multiplying any two non-1 parts of an integer partition until only one part remains, starting with 1^n.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =1a(4) =1a(5) =2a(6) =4a(7) =5a(8) =10a(9) =15a(10) =21a(11) =34a(12) =49a(13) =68a(14) =101a(15) =142a(16) =197a(17) =280a(18) =387a(19) =538a(20) =751a(21) =1045a(22) =1442a(23) =2010a(24) =2772a(25) =3865a(26) =5339a(27) =7396a(28) =10273a(29) =14201
External references
- oeis: A319909