login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #12 Jun 28 2012 03:22:13

%S 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 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 1,0,29,0,1,1,35,67,1,0,41,0,1,1,49,598,1,0

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

%H Jason Kimberley, <a href="/A185205/b185205.txt">Table of i, a(i)=D(n,k) for i = 1..147 (n = 1..43)</a>

%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_girth_ge_5">Disconnected regular graphs with girth at least 5</a>

%H 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 0;

%e 1;

%e 1;

%e 1, 1;

%e 1, 0;

%e 1, 1;

%e 1, 0;

%e 1, 1;

%e 1, 0;

%e 1, 1, 1;

%e 1, 0, 1;

%e 1, 1, 2;

%e 1, 0, 2;

%e 1, 1, 3;

%e 1, 0, 4;

%e 1, 1, 5;

%e 1, 0, 6;

%e 1, 1, 8;

%e 1, 0, 9;

%e 1, 1, 12, 1;

%e 1, 0, 14, 0;

%e 1, 1, 17, 2;

%e 1, 0, 20, 0;

%e 1, 1, 25, 12;

%e 1, 0, 29, 0;

%e 1, 1, 35, 67;

%e 1, 0, 41, 0;

%e 1, 1, 49, 598;

%e 1, 0, 57, 0;

%e 1, 1, 69, 7135;

%e 1, 0, 79, 0;

%e 1, 1, 94, 107826;

%e 1, 0, 109, 0;

%e 1, 1, 128, 1876709;

%e 1, 0, 149, 0;

%e 1, 1, 175, 35925162;

%e 1, 0, 201, 0;

%e 1, 1, 235, 741413221, 1;

%e 1, 0, 271, 0, 2;

%e 1, 1, 316, 16356258309, 11;

%e 1, 0, 363, 0, 147;

%e 1, 1, 422, 383936219233, 4215;

%e 1, 0, 483, 0, 132741;

%K nonn,hard,tabf

%O 1,24

%A _Jason Kimberley_, May 31 2012