login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A104593
Number of labeled planar 2-connected graphs with no vertex of degree 2 and with n vertices.
3
1, 25, 1317, 96012, 8976600, 1027205280, 139315157730, 21864486188160, 3898841480307900, 778680435365714700, 172192746831203449890, 41765231538761743574100, 11024455369912310561835600
OFFSET
4,2
COMMENTS
By empirical evidence, the terms possess a curious prime factor behavior. E.g. 2^4*3^4*5^2*7*11*13^2 divides a(16)=11024455369912310561835600.
LINKS
A. Gagarin, G. Labelle and P. Leroux, Counting labeled projective-planar graphs without a K_{3,3}-subdivision, arXiv:math/0406140 [math.CO], 2004-2006.
CROSSREFS
Cf. A104592.
Sequence in context: A174751 A042203 A042200 * A046910 A278851 A243943
KEYWORD
nonn
AUTHOR
Valery A. Liskovets, Mar 22 2005
STATUS
approved