A290397 Least number of nonprime squarefree numbers (A000469) that add up to n.

1, 2, 3, 4, 5, 1, 2, 3, 4, 1, 2, 2, 3, 1, 1, 2, 3, 3, 4, 2, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 1, 1, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 2, 1, 1, 1, 2

Offset: 1

Author

Ilya Gutkovskiy, Jul 29 2017

Keywords

• nonn

Comments

It is conjectured that a(n) <= 5.

Examples

			a(6) = 1 because 6 is already nonprime squarefree number.
a(7) = 2 because 7 = 6 + 1 is a partition of 7 into 2 nonprime squarefree parts and there is no such partition with fewer terms.
		

Crossrefs

Cf. A000469, A051034, A225926, A239508, A290136.