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.
%I A290397 #6 Jul 29 2017 19:28:16 %S A290397 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, %T A290397 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, %U A290397 1,1,2,2,2,1,2,2,1,1,2,2,2,1,2,2,1,1,1,2 %N A290397 Least number of nonprime squarefree numbers (A000469) that add up to n. %C A290397 It is conjectured that a(n) <= 5. %e A290397 a(6) = 1 because 6 is already nonprime squarefree number. %e A290397 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. %Y A290397 Cf. A000469, A051034, A225926, A239508, A290136. %K A290397 nonn %O A290397 1,2 %A A290397 _Ilya Gutkovskiy_, Jul 29 2017