Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: a118094 -id:a118094
Displaying 1-9 of 9 results found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A090371 Number of unrooted planar 2-constellations with n digons. Also number of n-edge unrooted planar Eulerian maps with bicolored faces. +10
10
1, 3, 6, 20, 60, 291, 1310, 6975, 37746, 215602, 1262874, 7611156, 46814132, 293447817, 1868710728, 12068905911, 78913940784, 521709872895, 3483289035186, 23464708686960, 159346213738020, 1090073011199451, 7507285094455566, 52021636161126702 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) is also the number of unrooted planar hypermaps with n darts up to orientation-preserving homeomorphism (darts are semi-edges in the particular case of ordinary maps). - Valery A. Liskovets, Apr 13 2006
LINKS
M. Bousquet-Mélou and G. Schaeffer, Enumeration of planar constellations, Adv. in Appl. Math. v.24 (2000), 337-368.
A. Mednykh and R. Nedela, Counting unrooted hypermaps on closed orientable surface, 18th Intern. Conf. Formal Power Series & Algebr. Comb., Jun 19, 2006, San Diego, California (USA).
A. Mednykh and R. Nedela, Enumeration of unrooted hypermaps of a given genus, Discr. Math., 310 (2010), 518-526. [From N. J. A. Sloane, Dec 19 2009]
A. Mednykh and R. Nedela, Recent progress in enumeration of hypermaps, J. Math. Sci., New York 226, No. 5, 635-654 (2017) and Zap. Nauchn. Semin. POMI 446, 139-164 (2016), table 2.
Timothy R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3.
EXAMPLE
The 3 Eulerian maps with 2 edges are the digon and two figure eight graphs ("8") in which both loops are colored, resp., black or white.
MAPLE
A090371 := proc(n)
local s, d;
if n=0 then
1 ;
else
s := -2^n*binomial(2*n, n);
for d in numtheory[divisors](n) do
s := s+ numtheory[phi](n/d)*2^d*binomial(2*d, d)
od;
3/(2*n)*(2^n*binomial(2*n, n)/((n+1)*(n+2))+s/2);
fi;
end proc:
MATHEMATICA
h0[n_] := 3*2^(n-1)*Binomial[2*n, n]/((n+1)*(n+2)); a[n_] := (h0[n] + DivisorSum[n, If[#>1, EulerPhi[#]*Binomial[n/#+2, 2]*h0[n/#], 0]&])/n; Array[a, 30] (* Jean-François Alcover, Dec 06 2015, adapted from PARI *)
PROG
(PARI) h0(n) = 3*2^(n-1)*binomial(2*n, n)/((n+1)*(n+2));
a(n) = (h0(n) + sumdiv(n, d, (d>1)*eulerphi(d)*binomial(n/d+2, 2)*h0(n/d)))/n; \\ Michel Marcus, Dec 11 2014
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Valery A. Liskovets, Dec 01 2003
EXTENSIONS
More terms from Michel Marcus, Dec 11 2014
STATUS
approved
A214819 Number of genus 2 sensed hypermaps with n darts. +10
7
0, 0, 0, 0, 4, 48, 708, 9807, 119436, 1355400, 14561360, 150429819 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
Mednykh, A.; Nedela, R. Recent progress in enumeration of hypermaps, J. Math. Sci., New York 226, No. 5, 635-654 (2017) and Zap. Nauchn. Semin. POMI 446, 139-164 (2016, table 4.
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 01 2012
STATUS
approved
A214820 Number of genus 3 sensed hypermaps with n darts. +10
7
0, 0, 0, 0, 0, 0, 30, 1155, 29910, 601364, 10260804, 156469887 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
LINKS
Mednykh, A.; Nedela, R. Recent progress in enumeration of hypermaps, J. Math. Sci., New York 226, No. 5, 635-654 (2017) and Zap. Nauchn. Semin. POMI 446, 139-164 (2016), table 5
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 01 2012
STATUS
approved
A118093 Numbers of rooted hypermaps on the torus with n darts (darts are semi-edges in the particular case of ordinary maps). +10
6
1, 15, 165, 1611, 14805, 131307, 1138261, 9713835, 81968469, 685888171, 5702382933, 47168678571, 388580070741, 3190523226795, 26124382262613, 213415462218411, 1740019150443861, 14162920013474475, 115112250539595093, 934419385591442091, 7576722323539318101 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,2
LINKS
A. Mednykh and R. Nedela, Counting unrooted hypermaps on closed orientable surface, 18th Intern. Conf. Formal Power Series & Algebr. Comb., Jun 19, 2006, San Diego, California (USA).
A. Mednykh and R. Nedela, Enumeration of unrooted hypermaps of a given genus, Discr. Math., 310 (2010), 518-526. [From N. J. A. Sloane, Dec 19 2009]
Mednykh, A.; Nedela, R. Recent progress in enumeration of hypermaps, J. Math. Sci., New York 226, No. 5, 635-654 (2017) and Zap. Nauchn. Semin. POMI 446, 139-164 (2016), table 3
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3.
P. G. Zograf, Enumeration of Grothendieck's Dessins and KP Hierarchy, International Mathematics Research Notices, Volume 2015, Issue 24, 1 January 2015, 13533-13544.
FORMULA
Conjecture: +n*(5*n-17)*a(n) -15*(n-1)*(5*n-16)*a(n-1) +12*(20*n^2-103*n+140)*a(n-2) +32*(5*n-12)*(2*n-5)*a(n-3)=0. - R. J. Mathar, Apr 05 2018
G.f.: (1 - 7*x + 4*x^2 - (1 - 3*x)*sqrt(1 - 8*x))/(8*(1 + x)*(1 - 8*x)); equivalently, the g.f. can be rewritten as (y - 1)^3/(4*(y - 2)^2*(y + 1)), where y=G(2*x) with G the g.f. of A000108. - Gheorghe Coserea, Nov 06 2018
a(n) ~ 2^(3*n - 4) / 3 * (1 - 10/(3*sqrt(Pi*n))). - Vaclav Kotesovec, Nov 06 2018
MATHEMATICA
Table[Sum[2^k (4^(n - 2 - k) - 1) Binomial[n+k, k] / 3, {k, 0, n-3}], {n, 3, 25}] (* Vincenzo Librandi, Sep 16 2018 *)
PROG
(PARI) a(n) = sum(k=0, n-3, 2^k*(4^(n-2-k)-1)*binomial(n+k, k))/3; \\ Michel Marcus, Dec 11 2014
(PARI)
seq(N) = {
my(x='x+O('x^(N+2)), y=(1-sqrt(1-8*x))/(4*x));
Vec((y - 1)^3/(4*(y - 2)^2*(y + 1)));
};
seq(21) \\ Gheorghe Coserea, Nov 06 2018
(Magma) [&+[(2^k*(4^(n-2-k)-1)*Binomial(n+k, k))/3 : k in [0..n-3]]: n in [3..25]]; // Vincenzo Librandi, Sep 16 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Valery A. Liskovets, Apr 13 2006
EXTENSIONS
More terms from Michel Marcus, Dec 11 2014
STATUS
approved
A214821 Number of genus 0 unsensed hypermaps with n darts. +10
5
1, 3, 6, 20, 57, 240, 954, 4566, 22641, 121823, 683307, 4004055 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 01 2012
STATUS
approved
A214823 Number of genus 2 unsensed hypermaps with n darts. +10
5
0, 0, 0, 0, 4, 39, 456, 5554, 63378, 698568, 7391499, 75807708 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 01 2012
STATUS
approved
A215017 Number of genus 3 unsensed hypermaps with n darts. +10
5
0, 0, 0, 0, 0, 0, 25, 678, 15867, 307880, 5180472, 78573507 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
LINKS
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 01 2012
STATUS
approved
A215018 Number of unsensed hypermaps with n darts and any genus. +10
5
1, 3, 7, 26, 91, 490, 2785, 20434, 171579, 1671193, 18192737, 218487504 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 01 2012
STATUS
approved
A214822 Number of genus 1 unsensed hypermaps with n darts. +10
0
0, 0, 1, 6, 30, 211, 1350, 9636, 69169, 513012, 3843024, 29107494 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 01 2012
STATUS
approved
page 1

Search completed in 0.008 seconds

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 8 13:05 EDT 2024. Contains 375753 sequences. (Running on oeis4.)