The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A123485

Number of n-node labeled trivalent (or cubic) graphs with connectivity 2.
(history; published version)

#4 by Russ Cox at Fri Mar 30 16:50:35 EDT 2012

AUTHOR

_N. J. A. Sloane (njas(AT)research.att.com), _, Nov 13 2006

Discussion

Fri Mar 30

16:50

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

#3 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010

LINKS

R. W. Robinson, <a href="/A123485/b123485.txt">Table of n, a(n) for n = 1..30</a>

KEYWORD

nonn,new

nonn

#2 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009

LINKS

R. W. Robinson, <a href="http://www.research.att.com/~njas/sequences/b123485.txt">Table of n, a(n) for n = 1..30</a>

KEYWORD

nonn,new

nonn

AUTHOR

N. J. A. Sloane (njas, (AT)research.att.com), Nov 13 2006

#1 by N. J. A. Sloane at Wed Dec 06 03:00:00 EST 2006

NAME

Number of n-node labeled trivalent (or cubic) graphs with connectivity 2.

DATA

0, 0, 0, 2520, 1814400, 1888563600, 2979953776800, 6935468956416000, 23019567930463104000, 105689740661883810432000, 653795414851090462030080000, 5326203537908913517889391360000

OFFSET

1,4

REFERENCES

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.

LINKS

R. W. Robinson, <a href="http://www.research.att.com/~njas/sequences/b123485.txt">Table of n, a(n) for n = 1..30</a>

KEYWORD

nonn,new

AUTHOR

njas, Nov 13 2006

STATUS

approved