login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

%I

%S 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,

%T 3,19,2,19,3,23,19,5,23,2,23,3,19,5,3,23,5,29

%N 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.

%C 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.

%C It can be shown that such a representation exists for all n.

%e 1=1

%e 2=2

%e 3=3

%e 4=3+1

%e 5=5

%e 6=5+1

%e 7=7

%e 8=5+3

%e 9=7+2

%e 10=7+3

%e 11=11

%e 12=7+5

%K nonn,tabf

%O 1,2

%A _N. J. A. Sloane_, based on a posting by Henry Baker to the math-fun list, Jul 22 2006

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.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 21:33 EST 2016. Contains 278755 sequences.