Nothing Special   »   [go: up one dir, main page]

login
Revision History for A007099 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of labeled trivalent (or cubic) 2-connected graphs with 2n nodes.
(history; published version)
#28 by Jon E. Schoenfield at Sun Dec 26 21:38:25 EST 2021
STATUS

editing

approved

#27 by Jon E. Schoenfield at Sun Dec 26 21:38:23 EST 2021
AUTHOR
STATUS

approved

editing

#26 by OEIS Server at Sat Jan 19 08:53:36 EST 2019
LINKS

R. W. Robinson, <a href="/A007099/b007099_1.txt">Table of n, a(n) for n = 1..29</a> (corrected by Michel Marcus, Jan 19 2019)

#25 by Vaclav Kotesovec at Sat Jan 19 08:53:36 EST 2019
STATUS

reviewed

approved

Discussion
Sat Jan 19
08:53
OEIS Server: Installed new b-file as b007099.txt.  Old b-file is now b007099_1.txt.
#24 by Joerg Arndt at Sat Jan 19 08:45:17 EST 2019
STATUS

proposed

reviewed

#23 by Michel Marcus at Sat Jan 19 08:42:35 EST 2019
STATUS

editing

proposed

#22 by Michel Marcus at Sat Jan 19 08:42:29 EST 2019
LINKS

R. W. Robinson, <a href="/A007099/b007099_1.txt">Table of n, a(n) for n = 21..29</a> (corrected by Michel Marcus, Jan 19 2019)

STATUS

approved

editing

#21 by R. J. Mathar at Thu Nov 08 11:26:53 EST 2018
STATUS

editing

approved

#20 by R. J. Mathar at Thu Nov 08 11:26:38 EST 2018
LINKS

G.-B. Chae, E. M. Palmer, R. W. Robinson, <a href="http://dx.doi.org/10.1016/j.disc.2007.03.011">Counting labeled general cubic graphs</a>, Discr. Math. 307 (2007) 2979-2992, eqs. (23) and (24).

MAPLE

s := proc(n)

option remember;

if n = 1 then

0;

elif n = 2 then

1;

else

3*n*procname(n-1)+2*procname(n-2)+(3*n-1)*add(procname(i)*procname(n-1-i), i=2..n-3) ;

end if;

end proc:

A007099 := proc(n)

if n = 1 then

0;

elif n = 2 then

1;

else

(2*n)!/3/n/2^n*(s(n)-2*s(n-1)) ;

end if;

end proc: # R. J. Mathar, Nov 08 2018

STATUS

approved

editing

#19 by Joerg Arndt at Wed Jan 17 11:39:41 EST 2018
STATUS

proposed

approved