The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A185135

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly 5.
(history; published version)

#9 by Charles R Greathouse IV at Thu May 01 02:37:07 EDT 2014

AUTHOR

_Jason Kimberley, _, Mar 21 2012

Discussion

Thu May 01

02:37

OEIS Server: https://oeis.org/edit/global/2191

#8 by Joerg Arndt at Fri Feb 22 10:48:37 EST 2013

STATUS

proposed

approved

#7 by Jason Kimberley at Fri Feb 22 09:50:55 EST 2013

STATUS

editing

proposed

#6 by Jason Kimberley at Fri Feb 22 09:50:33 EST 2013

LINKS

Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/E_k-reg_girth_eq_g_index">Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g</a>

#5 by Jason Kimberley at Fri Feb 22 09:39:41 EST 2013

CROSSREFS

Not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g: A185130 (triangle); fixed g: A185133 (g=3), A185134 (g=4), this sequence (g=5), A185136 (g=6).

STATUS

approved

editing

#4 by T. D. Noe at Thu Mar 22 11:09:04 EDT 2012

STATUS

proposed

approved

#3 by Jason Kimberley at Thu Mar 22 00:47:18 EDT 2012

STATUS

editing

proposed

#2 by Jason Kimberley at Wed Mar 21 23:54:52 EDT 2012

NAME

allocated for Jason KimberleyNumber of not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly 5.

DATA

0, 0, 0, 0, 0, 1, 2, 8, 48, 450, 5752, 90555, 1612917, 31297424, 652159986, 14499787794, 342646826428

OFFSET

0,7

FORMULA

a(n) = A185335(n) - A185336(n).

a(n) = A006925(n) + A185035(n).

KEYWORD

allocated

nonn,hard,more,changed

AUTHOR

Jason Kimberley, Mar 21 2012

STATUS

approved

editing

#1 by Jason Kimberley at Tue Jan 25 22:12:35 EST 2011

NAME

allocated for Jason Kimberley

KEYWORD

allocated

STATUS

approved