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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006415 Nonseparable toroidal tree-rooted maps with n + 3 edges and n + 1 vertices.
(Formerly M3705)
0
4, 104, 1020, 6092, 26670, 94128, 283338, 754380, 1821534, 4061200 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,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=0..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) = 4 * binomial(n + 4, n) + 84 * binomial(n + 4, n - 1) + 456 * binomial(n + 4, n - 2) + 996 * binomial(n + 4, n - 3) + 950 * binomial(n + 4, n - 4) + 330 * binomial(n + 5, n - 5). - Sean A. Irvine, Apr 03 2017

CROSSREFS

Sequence in context: A102439 A211150 A281534 * A181396 A196979 A197164

Adjacent sequences:  A006412 A006413 A006414 * A006416 A006417 A006418

KEYWORD

nonn

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 14 07:19 EST 2019. Contains 329111 sequences. (Running on oeis4.)