The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A210715

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

A210715

Number of disconnected regular simple graphs on n vertices with girth exactly 5.
(history; published version)

#5 by T. D. Noe at Wed Dec 12 11:28:15 EST 2012

STATUS

proposed

approved

#4 by Jason Kimberley at Wed Dec 12 08:30:24 EST 2012

STATUS

editing

proposed

#3 by Jason Kimberley at Mon Dec 10 08:53:10 EST 2012

DATA

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 6, 6, 9, 9, 22, 13, 82, 18, 618, 26, 7164, 36, 107862, 50, 1876730, 70, 35924810, 95, 741405213, 131, 16356067216, 323, 383931367731, 132977

#2 by Jason Kimberley at Mon Dec 10 08:47:49 EST 2012

NAME

allocated for Jason KimberleyNumber of disconnected regular simple graphs on n vertices with girth exactly 5.

DATA

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 6, 6, 9, 9, 22, 13, 82, 18, 618, 26, 7164, 36

OFFSET

0,16

LINKS

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

FORMULA

a(n) = A185215(n) - A185216(n).

KEYWORD

allocated

nonn,more,hard,changed

AUTHOR

Jason Kimberley, Dec 10 2012

STATUS

approved

editing

#1 by Jason Kimberley at Fri Mar 23 23:40:06 EDT 2012

NAME

allocated for Jason Kimberley

KEYWORD

allocated

STATUS

approved