|
%I #7 Nov 05 2012 19:30:25
%S 0,1,1,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,2,1,1,3,
%T 1,0,3,1,1,5,1,0,5,1,1,7,1,0,8,1,1,10,1,0,11,1,1,15,1,0,16,1,1,20,1,0,
%U 23,1,1,28,1,1,0,31,0,1,1,39,1,1,0,43,0,1,1,52,6,1,0,59,0,1,1,70,37,1,0,79,0
%N Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 6.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_girth_ge_6">Disconnected regular graphs with girth at least 6</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 1: 0;
%e 2: 1;
%e 3: 1;
%e 4: 1, 1;
%e 5: 1, 0;
%e 6: 1, 1;
%e 7: 1, 0;
%e 8: 1, 1;
%e 9: 1, 0;
%e 10: 1, 1;
%e 11: 1, 0;
%e 12: 1, 1, 1;
%e 13: 1, 0, 1;
%e 14: 1, 1, 2;
%e 15: 1, 0, 2;
%e 16: 1, 1, 3;
%e 17: 1, 0, 3;
%e 18: 1, 1, 5;
%e 19: 1, 0, 5;
%e 20: 1, 1, 7;
%e 21: 1, 0, 8;
%e 22: 1, 1, 10;
%e 23: 1, 0, 11;
%e 24: 1, 1, 15;
%e 25: 1, 0, 16;
%e 26: 1, 1, 20;
%e 27: 1, 0, 23;
%e 28: 1, 1, 28, 1;
%e 29: 1, 0, 31, 0;
%e 30: 1, 1, 39, 1;
%e 31: 1, 0, 43, 0;
%e 32: 1, 1, 52, 6;
%e 33: 1, 0, 59, 0;
%e 34: 1, 1, 70, 37;
%e 35: 1, 0, 79, 0;
%e 36: 1, 1, 95, 432;
%e 37: 1, 0, 106, 0;
%e 38: 1, 1, 125, 8119;
%e 39: 1, 0, 142, 0;
%e 40: 1, 1, 166, 191254;
%e 41: 1, 0, 187, 0;
%e 42: 1, 1, 220, 4855919;
%e 43: 1, 0, 247, 0;
%e 44: 1, 1, 287, 127937854;
%e 45: 1, 0, 325, 0;
%e 46: 1, 1, 375, 3482858263;
%e 47: 1, 0, 423, 0;
%e 48: 1, 1, 490, 98176518259;
%e 49: 1, 0, 551, 0;
%Y Disconnected k-regular simple graphs with girth at least 6: A185216 (all k), this sequence (triangle); A185226 (k=2), A185236 (k=3), A185246 (k=4).
%K nonn,hard,tabf
%O 1,28
%A _Jason Kimberley_, Nov 03 2012
|
