Weak Schur (Juha Saukkola)Discuss about this problem
Given k,find maximal n such that {1,2,..,n} can be partitioned into k sumfree sets.
S is sumfree :<==> (x,y in S x<y ==> x+y not in S)
http://dominia.org/~damancha/part.html
http://web.archive.org/web/20000526013619/www.ddj.com/articles/1999/9912/9912m/9912m.htm
2,8,23,66,196
Please send us a simpler description.