login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319925 Number of integer partitions with no 1's whose parts can be combined together using additions and multiplications to obtain n. 1

%I

%S 0,1,1,2,2,5,4,10,10,18,19,38,35,62,71,113,122,199,213,329

%N Number of integer partitions with no 1's whose parts can be combined together using additions and multiplications to obtain n.

%C All parts of the partition must be used in such a combination.

%F a(n) >= A001055(n).

%F a(n) >= A002865(n).

%e The a(8) = 10 partitions (which are not all partitions of 8):

%e (8),

%e (42), (62), (53), (44),

%e (222), (322), (422), (332),

%e (2222).

%e For example, this list contains (322) because we can write 8 = 3*2+2.

%Y Cf. A000792, A001970, A002865, A005520, A048249, A066739, A275870, A319850, A318949, A319909, A319910, A319912, A319913.

%K nonn,more

%O 1,4

%A _Gus Wiseman_, Oct 01 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 17:33 EST 2019. Contains 329201 sequences. (Running on oeis4.)