login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057848 Number of 1-connected claw-free cubic graphs with 2n nodes. 4
0, 1, 60, 2520, 453600, 59875200, 13621608000, 8009505504000, 3123380227968000, 1832279324908032000, 2054813830468439040000, 1665031453088810526720000, 1925086583971531588608000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

G.-B. Chae, Table of n, a(n) for n = 1..30

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)

CROSSREFS

Cf. A058929, A058930, A058931, A058932.

Sequence in context: A062263 A075917 A058929 * A082670 A084659 A230568

Adjacent sequences:  A057845 A057846 A057847 * A057849 A057850 A057851

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jan 12 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 05:41 EDT 2019. Contains 324346 sequences. (Running on oeis4.)