Search: id:A054381
Results 1-1 of 1 results found.

%I A054381
%S A054381 0,0,1,3,10,49,332
%N A054381 Number of n-node connected planar graphs with minimum degree at least 
               2.
%H A054381 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PlanarConnectedGraph.html">Link to a section of The World of Mathematics.</
               a>
%Y A054381 Cf. A049370.
%Y A054381 Sequence in context: A005921 A143921 A082426 this_sequence A102088 A088142 
               A049370
%Y A054381 Adjacent sequences: A054378 A054379 A054380 this_sequence A054382 A054383 
               A054384
%K A054381 nonn,hard
%O A054381 1,4
%A A054381 Eric Weisstein (eric(AT)weisstein.com)

Search completed in 0.001 seconds