%I A136406
%S A136406 1,1,1,1,1,1,1,3,1,1,1,2,3,1,1,1,3,4,3,1,1,1,3,5,4,3,1,1,1,5,6,8,4,3,1,
%T A136406 1,1,4,10,8,8,4,3,1,1,1,5,10,14,11,8,4,3,1,1,1,5,12,16,17,11,8,4,3,1,1,
%U A136406 1
%N A136406 Array read by rows: T(n,k) is the number of bi-partitions of the pair 
               (n,k) into pairs (n_i,k_i) of positive integers such that sum k_i 
               = k and sum n_i.k_i^2 = n.
%C A136406 T(n,1) = T(n,n) = 1.
%C A136406 T(n,n-k) does not depend on k if k <= floor(n/2).
%C A136406 The sum of the n^th row is A004101(n). [From Benoit Jubin (benoit_jubin(AT)yahoo.fr), 
               Sep 01 2008]
%Y A136406 Sequence in context: A136148 A132409 A030337 this_sequence A026568 A138361 
               A030408
%Y A136406 Adjacent sequences: A136403 A136404 A136405 this_sequence A136407 A136408 
               A136409
%K A136406 nonn,tabl
%O A136406 1,8
%A A136406 Benoit Jubin (benoit_jubin(AT)yahoo.fr), Apr 13 2008