%I A046082
%S A046082 1,1,1,2,4,19,139,2319,77423,4909331,554491273
%N A046082 Number of ultraconnected graphs on n unlabeled nodes.
%C A046082 The ultraconnected graphs are related to the positive definite matrix 
               completion problem.
%H A046082 W. W. Barrett, C. R. Johnson and R. Loewy, <a href="http://epubs.siam.org/
               sam-bin/dbq/article/32457">Critical graphs for the positive definite 
               completion problem.</a>, SIAM J. Matrix Anal. Appl., Vol. 20 (1999), 
               no. 1, 117-130.
%Y A046082 Sequence in context: A047092 A064228 A058130 this_sequence A048774 A061213 
               A063458
%Y A046082 Adjacent sequences: A046079 A046080 A046081 this_sequence A046083 A046084 
               A046085
%K A046082 hard,nonn
%O A046082 1,4
%A A046082 Jason Grout (grout(AT)math.byu.edu), May 07 2003