%I A049370
%S A049370 0,0,1,3,10,50,335,3194,39347,579323,9506939
%N A049370 Number of n-node planar graphs with minimum degree at least 2.
%H A049370 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
PlanarGraph.html">Link to a section of The World of Mathematics.</
a>
%Y A049370 Sequence in context: A054381 A102088 A088142 this_sequence A009343 A048175
A020132
%Y A049370 Adjacent sequences: A049367 A049368 A049369 this_sequence A049371 A049372
A049373
%K A049370 nonn,nice,hard
%O A049370 1,4
%A A049370 Brendan McKay (bdm(AT)cs.anu.edu.au)
|