|
Search: id:A118771
|
|
|
| A118771 |
|
Let a "sum" be a set {x,y,z} of distinct natural numbers such that x+y=z and let N_m={1,2,...m}. a(n) is the smallest s such that there is no partition of N_s into n sum-free parts. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
P. Blanchard, F. Harary and R. Reis, Partitions into sum-free sets, Integers: electronic journal of combinatorial number theory, 6. 2006.
|
|
EXAMPLE
|
For n=1, a(1)=3 as there is no partition of N_3={1,2,3} into 1-sum-free parts. In the same way a(2)=9...
|
|
CROSSREFS
|
Sequence in context: A096168 A051042 A121907 this_sequence A091587 A018047 A090577
Adjacent sequences: A118768 A118769 A118770 this_sequence A118772 A118773 A118774
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. Reis (rvr(AT)ncc.up.pt), May 22 2006
|
|
|
Search completed in 0.002 seconds
|
