A058931 -id:A058931 - cp's OEIS frontend

A057848 Number of 1-connected claw-free cubic graphs with 2n nodes.

0, 1, 60, 2520, 453600, 59875200, 13621608000, 8009505504000, 3123380227968000, 1832279324908032000, 2054813830468439040000, 1665031453088810526720000, 1925086583971531588608000000

Offset: 1

N. J. A. Sloane, Jan 12 2001

nonn

Sean A. Irvine, Table of n, a(n) for n = 1..100 (terms 1..30 from G.-B. Chae, term 30 corrected by Sean A. Irvine)
G.-B. Chae, Home page
G.-B. Chae, Counting labeled claw-free cubic graphs by connectivity, Discrete Mathematics 308 (2008) 5136-5143.
G.-B. Chae, E. M. Palmer and R. W. Robinson, Computing the number of Claw-free Cubic Graphs with given Connectivity, Preprint, 2000. (Annotated scanned copy)

Cf. A058929, A058930, A058931, A058932.

A058930 Number of 3-connected claw-free cubic graphs with 6n nodes.

Original entry on oeis.org

0, 60, 19958400, 622452999168000, 258520167388849766400000, 675289572271869736778268672000000, 7393367369949286697176489031997849600000000

Offset: 0

N. J. A. Sloane, Jan 12 2001

nonn

G.-B. Chae (chaegabb(AT)pilot.msu.edu), E. M. Palmer and R. W. Robinson, Computing the number of Claw-free Cubic Graphs with given Connectivity, preprint, 2001.