|
%I #8 Jan 02 2013 14:31:20
%S 1,1,2,6,1,16,0,60,2,266,2,1547,12,10786,31,88193,220,805579,1606,
%T 8037796,16829,86223660,193900,985883873,2452820,11946592242,32670332,
%U 1,152808993767,456028489,2,2056701139136,6636066134,8,28566369866514,100135577994,131
%N Irregular triangle E(n,g) counting not necessarily connected 4-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 A037233(g).
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_ge_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth at least g</a>
%e 1;
%e 1;
%e 2;
%e 6, 1;
%e 16, 0;
%e 60, 2;
%e 266, 2;
%e 1547, 12;
%e 10786, 31;
%e 88193, 220;
%e 805579, 1606;
%e 8037796, 16829;
%e 86223660, 193900;
%e 985883873, 2452820;
%e 11946592242, 32670332, 1;
%e 152808993767, 456028489, 2;
%e 2056701139136, 6636066134, 8;
%e 28566369866514, 100135577994, 131;
%K nonn,hard,tabf
%O 5,3
%A _Jason Kimberley_, Jan 02 2013
|
