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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006429 Number of tree-rooted planar maps with 4 vertices and n faces.
(Formerly M3716)
0
0, 4, 135, 1368, 7350, 28400, 89073, 241220, 585057, 1301420, 2699125 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Walsh, T. R. S.; Lehman, A. B.; Counting rooted maps by genus. III: Nonseparable maps. J. Combinatorial Theory Ser. B 18 (1975), 222-259.

LINKS

Table of n, a(n) for n=1..11.

FORMULA

Conjecture (for n>1): a(n) = n*(n+2)*(13*n^7+268*n^6+2254*n^5+4900*n^4-10703*n^3-62048*n^2+28596*n+137520) / 60480. - Sean A. Irvine, Apr 10 2017

CROSSREFS

Sequence in context: A274703 A045482 A263588 * A016483 A102986 A012160

Adjacent sequences:  A006426 A006427 A006428 * A006430 A006431 A006432

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Title improved by Sean A. Irvine, Apr 10 2017

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 November 16 22:05 EST 2019. Contains 329208 sequences. (Running on oeis4.)