The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A185234 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A185234

Number of disconnected 3-regular simple graphs on 2n vertices with girth at least 4.
(history; published version)

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

AUTHOR

_Jason Kimberley, _, Feb 22 2011

Discussion

Thu May 01

02:37

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

#11 by Joerg Arndt at Sun Jan 20 03:36:09 EST 2013

STATUS

proposed

approved

#10 by Jason Kimberley at Sun Jan 20 00:48:00 EST 2013

STATUS

editing

proposed

#9 by Jason Kimberley at Sun Jan 20 00:35:44 EST 2013

KEYWORD

nonn,hard,more,changed

#8 by Jason Kimberley at Sun Jan 20 00:30:12 EST 2013

CROSSREFS

Disconnected k-regular simple graphs with girth at least 4: A185214 (any k), A185204 (triangle); specified degree k: A185224 (k=2), this sequence (k=3), A185244 (k=4), A185254 (k=5), A185264 (k=6), A185274 (k=7), A185284 (k=8), A185294 (k=9).

STATUS

approved

editing

#7 by T. D. Noe at Fri Nov 04 11:38:47 EDT 2011

STATUS

proposed

approved

#6 by Jason Kimberley at Fri Nov 04 08:43:27 EDT 2011

STATUS

editing

proposed

#5 by Jason Kimberley at Fri Nov 04 08:43:17 EDT 2011

KEYWORD

nonn,changed,hard

#4 by Jason Kimberley at Fri Nov 04 08:42:23 EDT 2011

LINKS

Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_ge_g_index">Index of sequences counting disconnected k-regular simple graphs with girth at least g</a>

STATUS

approved

editing

#3 by N. J. A. Sloane at Thu Feb 24 01:14:03 EST 2011

STATUS

proposed

approved