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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006413 Nonseparable planar tree-rooted maps with n + 4 edges and 5 vertices.
(Formerly M4031)
2
5, 210, 3150, 27556, 170793, 829920, 3359356, 11786190, 36845718 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

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

LINKS

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

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

FORMULA

Conjecture: a(n) = 5 * binomial(n + 6, n - 1) + 170 * binomial(n + 6, n - 2) + 1440 * binomial(n + 6, n - 3) + 4906 * binomial(n + 6, n - 4) + 7927 * binomial(n + 6, n - 5) + 6090 * binomial(n + 6, n - 6) + 1794 * binomial(n + 6, n - 7). - Sean A. Irvine, Apr 03 2017

CROSSREFS

Cf. A006411, A006412.

Sequence in context: A144139 A020541 A027682 * A055316 A203470 A165208

Adjacent sequences:  A006410 A006411 A006412 * A006414 A006415 A006416

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane.

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 20 13:19 EST 2019. Contains 329336 sequences. (Running on oeis4.)