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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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

Views

Author

Ilya Gutkovskiy, Jul 29 2017

Keywords

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

Showing 1-1 of 1 results.