0,5

Jason Kimberley, Table of n, a(n) for n = 0..116

Jason Kimberley, Index of sequences counting disconnected k-regular simple graphs with girth at least g

a(116) = 89574 because there is 1 such 0-regular graph (116 disconnected vertices), 1 such 1-regular graph (58 loose edges), A185229(116) = 89401, and 171 such 3-regular graphs (because A210709(58)=18).

Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), A185217 (g=7), A185218 (g=8), this sequence (g=9).

Sequence in context: A161063 A161267 A161292 * A161319 A161253 A161038

Adjacent sequences: A185216 A185217 A185218 * A185220 A185221 A185222

nonn,hard

Jason Kimberley, Dec 19 2012

approved