|
%I #17 May 01 2014 02:37:01
%S 1,5,1547,21609300,1,733351105933,1
%N Irregular triangle C(n,g) counting the connected 7-regular simple graphs on 2n vertices with girth exactly g.
%C The first column is for girth exactly 3. The row length sequence starts: 1, 1, 1, 2, 2, 2, 2, 2. The row length is incremented to g-2 when 2n reaches A054760(7,g).
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_eq_g_index">Index of sequences counting connected k-regular simple graphs with girth exactly g</a>
%H Jason Kimberley, <a href="/A184970/a184970.txt">Incomplete table of i, n, g, C(n,g)=a(i) for row n = 4..11</a>
%e 1;
%e 5;
%e 1547;
%e 21609300, 1;
%e 733351105933, 1;
%e ?, 8;
%e ?, 741;
%e ?, 2887493;
%Y Connected 7-regular simple graphs with girth at least g: A184971 (triangle); chosen g: A014377 (g=3), A181153 (g=4).
%Y Connected 7-regular simple graphs with girth exactly g: this sequence (triangle); chosen g: A184973 (g=3), A184974 (g=4)).
%Y Triangular arrays C(n,g) counting connected simple k-regular graphs on n vertices with girth exactly g: A198303 (k=3), A184940 (k=4), A184950 (k=5), A184960 (k=6), this sequence (k=7), A184980 (k=8).
%K nonn,hard,more,tabf
%O 4,2
%A _Jason Kimberley_, Feb 25 2011
|
