The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185340 Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth at least g. 1
 1, 1, 2, 6, 1, 16, 0, 60, 2, 266, 2, 1547, 12, 10786, 31, 88193, 220, 805579, 1606, 8037796, 16829, 86223660, 193900, 985883873, 2452820, 11946592242, 32670332, 1, 152808993767, 456028489, 2, 2056701139136, 6636066134, 8, 28566369866514, 100135577994, 131 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,3 COMMENTS The first column is for girth at least 3. The row length is incremented to g-2 when n reaches A037233(g). LINKS EXAMPLE 1; 1; 2; 6, 1; 16, 0; 60, 2; 266, 2; 1547, 12; 10786, 31; 88193, 220; 805579, 1606; 8037796, 16829; 86223660, 193900; 985883873, 2452820; 11946592242, 32670332, 1; 152808993767, 456028489, 2; 2056701139136, 6636066134, 8; 28566369866514, 100135577994, 131; CROSSREFS Sequence in context: A264789 A111519 A184941 * A280568 A280836 A281307 Adjacent sequences:  A185337 A185338 A185339 * A185341 A185342 A185343 KEYWORD nonn,hard,tabf AUTHOR Jason Kimberley, Jan 02 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 4 11:32 EDT 2020. Contains 334825 sequences. (Running on oeis4.)