|
%I #11 May 01 2014 02:36:25
%S 1,1,6,94,10786,3459386,1470293676,733351105935,1
%N Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth at least g.
%C The first column is for girth at least 3. The row length is incremented to g-2 when n reaches A054760(8,g).
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_ge_g_index">Index of sequences counting connected k-regular simple graphs with girth at least g</a>
%e 1;
%e 1;
%e 6;
%e 94;
%e 10786;
%e 3459386;
%e 1470293676;
%e 733351105935, 1;
%e ?, 0;
%e ?, 1;
%e ?, 0;
%e ?, 13;
%e ?, 1;
%Y Connected 8-regular simple graphs with girth at least g: this sequence (triangle); chosen g: A014378 (g=3), A181154 (g=4).
%Y Connected 8-regular simple graphs with girth exactly g: A184980 (triangle); chosen g: A184983 (g=3).
%Y Triangular arrays C(n,g) counting connected simple k-regular graphs on n vertices with girth at least g: A185131 (k=3), A184941 (k=4), A184951 (k=5), A184961 (k=6), A184971 (k=7), this sequence (k=8), A184991 (k=9).
%K nonn,hard,more,tabf
%O 9,3
%A _Jason Kimberley_, Jan 19 2012
|
