cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Oct 01 2018

Keywords

Comments

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

Examples

			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.
		

Crossrefs

Formula

a(n) >= A001055(n).
a(n) >= A002865(n).