%I A005636 M1548
%S A005636 1,1,0,2,5,32,234,3638,106147,6039504,633754161,120131932774,
%T A005636 41036773627286,25445404202438466,28918219616495404542,
%U A005636 60799423389360189091576,238378454962362129667078385
%N A005636 Number of n-node connected graphs without points of degree 2.
%D A005636 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A005636 R. W. Robinson, personal communication.
%D A005636 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
%H A005636 R. W. Robinson, <a href="b005636.txt">Table of n, a(n) for n = 1..28</
               a>
%Y A005636 Sequence in context: A145656 A009274 A019036 this_sequence A067299 A118325 
               A019037
%Y A005636 Adjacent sequences: A005633 A005634 A005635 this_sequence A005637 A005638 
               A005639
%K A005636 nonn
%O A005636 1,4
%A A005636 N. J. A. Sloane (njas(AT)research.att.com).