#来自在线整数序列百科全书的问候!搜索:id:a02906 显示1-1的1 将一个一个一个的1个 ;%I A0229906;%S A0229906 1,0,0,0,1,1,2,3,3,3,2,0,3,3,2,0,3,5,6,6,5,6,6,3,4,6,9,7,4,4,4,6,6,7,9,8,6,6,4,4,4,4,4,4,6,7,9,8,6,6,4,7,7,10,10,10,8,10,10,8,10,10,10,8,10,10,10,10,10,10,6,10,13,14,13,11,8,9,12,17,12,8,9,12,13, %U a022906 15,13,9,8,12,16,17,15,12,9,11,15,20,14,10,13,14,18,14,11,9 %N a022906 a(N)=M(N)-M(N)>=2,其中M(n)=max{a(i)+a(n-i):i=1..n-1},M(n)=min{a(i)+a(n-i):i=1..n-1}。;%Y A0229906 Cf.A022909,A022910。;%K aA0229066 nonn;%O aA022906 1,5;%a aA022906 _克拉克·金伯利龙 10; 内容可根据OEIS最终用户许可协议提供的OEIS最终用户许可协议:http://OEIS.OEIS.OEIS.OEIS.OEIS.http组织/许可证