login
Number of unlabeled graphs with n nodes and degree >= 3.
(Formerly M3060)
3

%I M3060 #13 May 21 2019 10:48:14

%S 0,0,0,0,1,3,19,150,2590,84245,5203135,577076735,113373008891,

%T 39618075369549,24916469695937480,28563628406766988588,

%U 60366734880395211775791,237406976195471782149927759,1750330442243458287054664072364

%N Number of unlabeled graphs with n nodes and degree >= 3.

%D R. W. Robinson, personal communication.

%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H R. W. Robinson, <a href="/A007111/b007111.txt">Table of n, a(n) for n = 0..28</a>

%Y Euler transform of A007112.

%K nonn

%O 0,6

%A _N. J. A. Sloane_.