This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A120428 Triangle read by rows in which row n gives a representation of n as a sum of distinct numbers from {1, primes} with a minimal number of terms. 0
 1, 2, 3, 3, 1, 5, 5, 1, 7, 5, 3, 7, 2, 7, 3, 11, 7, 5, 13, 11, 3, 13, 2, 13, 3, 17, 13, 5, 19, 17, 3, 19, 2, 19, 3, 23, 19, 5, 23, 2, 23, 3, 19, 5, 3, 23, 5, 29 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS If there are several solutions with the minimal number of terms, choose the one with the greatest leading term, then the greatest second term, etc. It can be shown that such a representation exists for all n. LINKS EXAMPLE 1=1 2=2 3=3 4=3+1 5=5 6=5+1 7=7 8=5+3 9=7+2 10=7+3 11=11 12=7+5 CROSSREFS Sequence in context: A085667 A220114 A035516 * A079950 A174953 A298599 Adjacent sequences:  A120425 A120426 A120427 * A120429 A120430 A120431 KEYWORD nonn,tabf AUTHOR N. J. A. Sloane, based on a posting by Henry Baker to the math-fun list, Jul 22 2006 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 20 14:40 EST 2019. Contains 319333 sequences. (Running on oeis4.)