User:Jason Kimberley/D girth ge 4

girth	C	D	E
$\geq$	Cge	Dge	Ege
$=$	Ceq	Deq	Eeq

A185204:

Triangular array $D(n,k)=$ the number of disconnected $k$-regular graphs, having girth at least 4, with $n$ nodes, for $0\leq k\leq n/4$.

A185214	$n$	A157928	A157928	A185224	A185234	A185244	A185254	A185264	A185274	A185284	A185294
$\Sigma$	$k$	0	1	2	3	4	5	6	7	8	9
0	1	0
1	2	1
1	3	1
2	4	1	1
1	5	1	0
2	6	1	1
1	7	1	0
3	8	1	1	1
2	9	1	0	1
4	10	1	1	2
3	11	1	0	2
7	12	1	1	4	1
5	13	1	0	4	0
10	14	1	1	6	2
8	15	1	0	7	0
22	16	1	1	10	9	1
12	17	1	0	11	0	0
54	18	1	1	15	35	2
20	19	1	0	17	0	2
218	20	1	1	23	177	15	1
62	21	1	0	26	0	35	0
1436	22	1	1	33	1153	247	1
1731	23	1	0	38	0	1692	0
27810	24	1	1	49	10341	17409	8	1
197981	25	1	0	56	0	197924	0	0
2613814	26	1	1	69	120523	2492824	395	1
33117962	27	1	0	80	0	33117880	0	1
463707741	28	1	1	99	1702432	461597957	407240	10	1
6709514340	29	1	0	114	0	6709514218	0	7	0
102306352539	30	1	1	139	27507351	101153412903	1125431866	277	1
1597440872801	31	1	0	160	0	1597440868898	0	3742	0
	32	1	1	194	492377298		3814677304834	483330	9	1
	33	1	0	224	0		0	69827771	0	0
	34	1	1	268	9600913017			14836620025	749	1	0
	35	1	0	310	0				0	0
	36	1	1	370	201990426697				2888270	14	1
	37	1	0	426	0				0	1	0
	38	1	1	504	4555849947783						1
	39	1	0	582	0						0	0
	40	1	1	687							15