User:Jason Kimberley/E girth ge 4

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

A185304:

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

The $(k,4)$-cage is $K_{k,k}$.

E with girth at least: 3 4 5

A185314	$n$			A008484	A185334	A185344	A185354	A185364
$\forall$	$k$	0	1	2	3	4	5	6	7	8	9	10
1	1	1
2	2	1	1
1	3	1	0
3	4	1	1	1
2	5	1	0	1
4	6	1	1	1	1
2	7	1	0	1	0
7	8	1	1	2	2	1
3	9	1	0	2	0	0
13	10	1	1	2	6	2	1
6	11	1	0	3	0	2	0
44	12	1	1	5	23	12	1	1
37	13	1	0	5	0	31	0	0
350	14	1	1	7	112	220	7	1	1
1616	15	1	0	8	0	1606	0	1	0
18042	16	1	1	11	801	16829	388	9	1	1
193919	17	1	0	12	0	193900	0	6	0	0
2867779	18	1	1	16	7840	2452820	406824	267	8	1	1
32674078	19	1	0	18	0	32670332	0	3727	0	0	0
1581632332	20	1	1	24	97723	456028489	1125022326	483012	741	13	1	1
6705889886	21	1	0	27	0	6636066134	0	69823723	0	1	0	0
	22	1	1	34	1436873	100135577994	3813549359275	14836130862	2887493		14	1
	23	1	0	39	0	1582718914660						0
	24	1	1	50	23791155
	25	1	0	57	0
	26	1	1	70	432878091
	27	1	0	81	0
	28	1	1	100	8544173926
	29	1	0	115	0
	30	1	1	140	181519645163
	31	1	0	161	0
	32	1	1	195	4127569521160