%I A005703 M1151
%S A005703 1,1,1,2,4,8,19,44,112,287,763,2041,5577,15300,42419,118122,330785,
%T A005703 929469,2621272,7411706,21010378,59682057,169859257,484234165,
%U A005703 1382567947,3952860475,11315775161,32430737380,93044797486,267211342954
%N A005703 Number of n-node connected graphs with at most one cycle.
%D A005703 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 
               150.
%D A005703 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A005703 Wikipedia, <a href="http://en.wikipedia.org/wiki/Pseudoforest">Pseudoforest</
               a>.
%F A005703 a(n)=A000055(n)+A001429(n)
%Y A005703 Sequence in context: A037444 A151526 A099526 this_sequence A003081 A100133 
               A099598
%Y A005703 Adjacent sequences: A005700 A005701 A005702 this_sequence A005704 A005705 
               A005706
%K A005703 nonn,easy,nice
%O A005703 0,4
%A A005703 N. J. A. Sloane (njas(AT)research.att.com), R. K. Guy
%E A005703 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 19 2000 and 
               from Michael Somos, Apr 26 2000
%E A005703 a(27) corrected and a(28) and a(29) computed by Washington Bomfim (webonfim(AT)bol.com.br), 
               May 14 2008