This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A290397 Least number of nonprime squarefree numbers (A000469) that add up to n. 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS It is conjectured that a(n) <= 5. LINKS EXAMPLE 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. Sequence in context: A190595 A280502 A276757 * A053841 A010884 A105932 Adjacent sequences:  A290394 A290395 A290396 * A290398 A290399 A290400 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Jul 29 2017 STATUS approved

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

Last modified October 20 15:44 EDT 2018. Contains 316389 sequences. (Running on oeis4.)