cp's OEIS Frontend

A185207 Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 7.

%I A185207 #11 Oct 28 2012 10:23:30
%S A185207 0,1,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,2,1,0,
%T A185207 2,1,1,3,1,0,3,1,1,4,1,0,5,1,1,6,1,0,7,1,1,9,1,0,10,1,1,12,1,0,14,1,1,
%U A185207 17,1,0,19,1,1,23,1,0,26,1,1,31,1,0,35,1,1,41,1,0,47,1,1,55,1,0,62,1,1,72
%N A185207 Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 7.
%H A185207 Jason Kimberley, <a href="/A185207/b185207.txt">Table of i, a(n)=D(n,k) for i = 1..192 (n = 1..64) </a>
%H A185207 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_ge_g_index">Index of sequences counting disconnected k-regular simple graphs with girth at least g</a>
%e A185207 1: 0;
%e A185207 2: 1;
%e A185207 3: 1;
%e A185207 4: 1, 1;
%e A185207 5: 1, 0;
%e A185207 ...
%e A185207 12: 1, 1;
%e A185207 13: 1, 0;
%e A185207 14: 1, 1, 1;
%e A185207 15: 1, 0, 1;
%e A185207 16: 1, 1, 2;
%e A185207 ...
%e A185207 47: 1, 0, 235;
%e A185207 48: 1, 1, 269, 1;
%e A185207 ...
%e A185207 58: 1, 1, 910, 1885410;
%e A185207 59: 1, 0, 1021, 0;
%e A185207 60: 1, 1, 1152, 101214662;
%e A185207 61: 1, 0, 1290, 0;
%e A185207 62: 1, 1, 1452, 5025320937;
%Y A185207 Disconnected k-regular simple graphs with girth at least 7: A185217 (all k), this sequence (triangle); A185227 (k=2), A185237 (k=3).
%K A185207 nonn,hard,tabf
%O A185207 1,32
%A A185207 _Jason Kimberley_, Oct 27 2012