%I A005637 M0352
%S A005637 1,1,2,2,5,10,45,284,3960,110356,6153615,640014800,120777999811,
%T A005637 41158185726269,25486682538903526,28943747337743989421,
%U A005637 60828392582465943631269,238439312273287947102629832
%N A005637 Number of n-node graphs without nodes of degree 2.
%D A005637 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A005637 R. W. Robinson, personal communication.
%D A005637 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
%H A005637 R. W. Robinson, <a href="b005637.txt">Table of n, a(n) for n = 0..28</
               a>
%Y A005637 Sequence in context: A075125 A081374 A117400 this_sequence A104080 A078405 
               A109278
%Y A005637 Adjacent sequences: A005634 A005635 A005636 this_sequence A005638 A005639 
               A005640
%K A005637 nonn
%O A005637 0,3
%A A005637 N. J. A. Sloane (njas(AT)research.att.com).