cp's OEIS Frontend

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

%I A185205 #12 Jun 28 2012 03:22:13
%S A185205 0,1,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,2,1,0,2,1,1,3,1,0,4,1,
%T A185205 1,5,1,0,6,1,1,8,1,0,9,1,1,12,1,1,0,14,0,1,1,17,2,1,0,20,0,1,1,25,12,
%U A185205 1,0,29,0,1,1,35,67,1,0,41,0,1,1,49,598,1,0
%N A185205 Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 5.
%H A185205 Jason Kimberley, <a href="/A185205/b185205.txt">Table of i, a(i)=D(n,k) for i = 1..147 (n = 1..43)</a>
%H A185205 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_girth_ge_5">Disconnected regular graphs with girth at least 5</a>
%H A185205 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 A185205 0;
%e A185205 1;
%e A185205 1;
%e A185205 1, 1;
%e A185205 1, 0;
%e A185205 1, 1;
%e A185205 1, 0;
%e A185205 1, 1;
%e A185205 1, 0;
%e A185205 1, 1, 1;
%e A185205 1, 0, 1;
%e A185205 1, 1, 2;
%e A185205 1, 0, 2;
%e A185205 1, 1, 3;
%e A185205 1, 0, 4;
%e A185205 1, 1, 5;
%e A185205 1, 0, 6;
%e A185205 1, 1, 8;
%e A185205 1, 0, 9;
%e A185205 1, 1, 12, 1;
%e A185205 1, 0, 14, 0;
%e A185205 1, 1, 17, 2;
%e A185205 1, 0, 20, 0;
%e A185205 1, 1, 25, 12;
%e A185205 1, 0, 29, 0;
%e A185205 1, 1, 35, 67;
%e A185205 1, 0, 41, 0;
%e A185205 1, 1, 49, 598;
%e A185205 1, 0, 57, 0;
%e A185205 1, 1, 69, 7135;
%e A185205 1, 0, 79, 0;
%e A185205 1, 1, 94, 107826;
%e A185205 1, 0, 109, 0;
%e A185205 1, 1, 128, 1876709;
%e A185205 1, 0, 149, 0;
%e A185205 1, 1, 175, 35925162;
%e A185205 1, 0, 201, 0;
%e A185205 1, 1, 235, 741413221, 1;
%e A185205 1, 0, 271, 0, 2;
%e A185205 1, 1, 316, 16356258309, 11;
%e A185205 1, 0, 363, 0, 147;
%e A185205 1, 1, 422, 383936219233, 4215;
%e A185205 1, 0, 483, 0, 132741;
%K A185205 nonn,hard,tabf
%O A185205 1,24
%A A185205 _Jason Kimberley_, May 31 2012