login
A319925
Number of integer partitions with no 1's whose parts can be combined together using additions and multiplications to obtain n.
1
0, 1, 1, 2, 2, 5, 4, 10, 10, 18, 19, 38, 35, 62, 71, 113, 122, 199, 213, 329
OFFSET
1,4
COMMENTS
All parts of the partition must be used in such a combination.
FORMULA
a(n) >= A001055(n).
a(n) >= A002865(n).
EXAMPLE
The a(8) = 10 partitions (which are not all partitions of 8):
(8),
(42), (62), (53), (44),
(222), (322), (422), (332),
(2222).
For example, this list contains (322) because we can write 8 = 3*2+2.
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Oct 01 2018
STATUS
approved