%I A059441
%S A059441 1,1,1,1,0,1,1,3,3,1,1,0,12,0,1,1,15,70,70,15,1,1,0,465,0,465,0,1,1,
%T A059441 105,3507,19355,19355,3507,105,1
%N A059441 Triangle T(n,k) (n >= 1, 0<=k<=n-1) giving number of regular labeled 
               graphs with n nodes and degree k, read by rows.
%D A059441 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 279.
%e A059441 1; 1,1; 1,0,1; 1,3,3,1; ...
%Y A059441 Diagonals give A001205, A002829, A005815.
%Y A059441 Sequence in context: A065547 A143333 A065551 this_sequence A059790 A130778 
               A016554
%Y A059441 Adjacent sequences: A059438 A059439 A059440 this_sequence A059442 A059443 
               A059444
%K A059441 tabl,nice,nonn
%O A059441 1,8
%A A059441 N. J. A. Sloane (njas(AT)research.att.com), Feb 01 2001