Search: id:A001072 Results 1-1 of 1 results found. %I A001072 %S A001072 1,1,3,4,11,23,63,159 %N A001072 Number of minimally 2-edge-connected graphs with n nodes. %D A001072 Calculated by Sridar K. Pootheri %Y A001072 Sequence in context: A001643 A005218 A131481 this_sequence A077900 A041231 A042129 %Y A001072 Adjacent sequences: A001069 A001070 A001071 this_sequence A001073 A001074 A001075 %K A001072 nonn,hard %O A001072 3,3 %A A001072 R. W. Robinson, rwr(AT)pollux.cs.uga.edu Search completed in 0.001 seconds