%I A079211
%S A079211 1,1,1,1,1,1,2,1,1,1,2,1,1,1,1,3,2,1,1,1,1,4,2,1,1,1,1,1,5,3,2,1,1,1,1,
%T A079211 1,6,3,2,1,1,1,1,1,1,8,5,3,2,1,1,1,1,1,1,10,5,3,2,1,1,1,1,1,1,1,12,7,4,
%U A079211 3,2,1,1,1,1,1,1,1,15,8,5,3,2,1,1,1,1,1,1,1,1,18,10,6,4,3,2,1,1,1,1,1,
               1
%N A079211 Triangle t(n,k) of numbers of partitions of n into distinct numbers not 
               less k, 0<=k<=n.
%C A079211 t(n,k+1)<=t(n,k)<=t(n+1,k); t(n,k)>1 iff 0<=2*k+1<n.
%H A079211 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PartitionFunctionQ.html">Partition Function Q</a>.
%H A079211 Reinhard Zumkeller, <a href="a079211.txt">Notes on initial terms</a>
%F A079211 t(n, k) = 1 + Sum(t(i, j): i>j>k and i+j=n), 0<=k<=n.
%Y A079211 A000009(n)=t(n, 0), left border of the triangle, A025147(n)=t(n, 1) for 
               n>1.
%Y A079211 Sequence in context: A143898 A101873 A146289 this_sequence A081418 A088951 
               A107453
%Y A079211 Adjacent sequences: A079208 A079209 A079210 this_sequence A079212 A079213 
               A079214
%K A079211 nonn,tabl
%O A079211 0,7
%A A079211 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 01 2003