cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

A342980 Triangle read by rows: T(n,k) is the number of rooted loopless planar maps with n edges, k faces and no isthmuses, n >= 0, k = 1..n+1.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 8, 1, 0, 0, 1, 20, 20, 1, 0, 0, 1, 38, 131, 38, 1, 0, 0, 1, 63, 469, 469, 63, 1, 0, 0, 1, 96, 1262, 3008, 1262, 96, 1, 0, 0, 1, 138, 2862, 12843, 12843, 2862, 138, 1, 0, 0, 1, 190, 5780, 42602, 83088, 42602, 5780, 190, 1, 0
Offset: 0

Views

Author

Andrew Howroyd, Apr 01 2021

Keywords

Comments

The number of vertices is n + 2 - k.
For k >= 2, columns k without the initial zero term is a polynomial of degree 3*(k-2). This is because adding a face can increase the number of vertices whose degree is greater than two by at most two.

Examples

			Triangle begins:
  1;
  0, 0;
  0, 1,   0;
  0, 1,   1,    0;
  0, 1,   8,    1,     0;
  0, 1,  20,   20,     1,     0;
  0, 1,  38,  131,    38,     1,    0;
  0, 1,  63,  469,   469,    63,    1,   0;
  0, 1,  96, 1262,  3008,  1262,   96,   1, 0;
  0, 1, 138, 2862, 12843, 12843, 2862, 138, 1, 0;
  ...
		

Crossrefs

Columns (and diagonals) are A006416, A006417, A006418.
Row sums are A099553(n+1).

Programs

  • Mathematica
    G[m_, y_] := Sum[x^n*Sum[(n + k - 1)!*(2*n - k)!*y^k/(k!*(n + 1 - k)!*(2*k - 1)!*(2*n - 2*k + 1)!), {k, 1, n}], {n, 1, m}] + O[x]^m;
    H[n_] := With[{g = 1 + x*G[n - 1, y]}, Sqrt[InverseSeries[x/g^2 + O[x]^(n + 1), x]/x]];
    Join[{{1}, {0, 0}}, Append[CoefficientList[#, y], 0]& /@ CoefficientList[ H[11], x][[3;;]]] // Flatten (* Jean-François Alcover, Apr 15 2021, after Andrew Howroyd *)
  • PARI
    \\ here G(n,y) gives A082680 as g.f.
    G(n,y)={sum(n=1, n, x^n*sum(k=1, n, (n+k-1)!*(2*n-k)!*y^k/(k!*(n+1-k)!*(2*k-1)!*(2*n-2*k+1)!))) + O(x*x^n)}
    H(n)={my(g=1+x*G(n-1, y), v=Vec(sqrt(serreverse(x/g^2)/x))); vector(#v, n, Vecrev(v[n], n))}
    { my(T=H(8)); for(n=1, #T, print(T[n])) }

Formula

T(n,n+2-k) = T(n,k).
G.f.: A(x,y) satisfies A(x,y) = G(x*A(x,y)^2,y) where G(x,y) = 1 + x*B(x,y) and B(x,y) is the g.f. of A082680.

A318101 Number of rooted 2-connected 4-regular planar maps, which may have loops, with n inner faces.

Original entry on oeis.org

2, 9, 30, 154, 986, 6977, 52590, 415678, 3409032, 28787498, 248930292, 2195238596, 19682012382, 178974809121, 1647460326046, 15327261314934, 143942130406288, 1363094805806462, 13004498819335396, 124900418475706476, 1206861624598185332, 11725558427958257690, 114494070652568918380
Offset: 2

Views

Author

Gheorghe Coserea, Aug 16 2018

Keywords

Examples

			A(x) = 2*x^2 + 9*x^3 + 30*x^4 + 154*x^5 + 986*x^6 + 6977*x^7 + 52590*x^8 + ...
		

Crossrefs

Programs

  • PARI
    F = (1 - z + 2*z^3*x*(1 - x))/(2*z*(1 - z^2*x));
    G = x*(4*x^2 + 1)*z^4 - 4*x*(2*x - 1)*z^3 - 5*x*z^2 + 2*(2*x - 1)*z + 2;
    Z(N) = {
      my(z0=1+O('x^N), z1=0, n=1);
      while (n++,
        z1 = z0 - subst(G, 'z, z0)/subst(deriv(G, 'z), 'z, z0);
        if (z1 == z0, break()); z0 = z1);
      z0;
    };
    seq(N) = Vec((1 + 2*x)*subst(F, 'z, Z(N+2)));
    seq(23)
    \\ test: y=Ser(seq(303))*x^2; 0 == 8*y^4 + 4*(2*x + 1)*(2*x + 3)*y^3 - (x - 6)*(2*x + 1)^2*y^2 + (2*x + 1)^3*(18*x^2 - 16*x + 1)*y + x^2*(2*x + 1)^4*(27*x - 2)

Formula

G.f.: (1 + 2*x)*F, where F = (1 - z + 2*z^3*x*(1 - x))/(2*z*(1 - z^2*x)) and z = 1 + 2*x + 6*x^2 + 34*x^3 + 254*x^4 + 2052*x^5 + 17332*x^6 + 151658*x^7 + ... satisfies 0 = x*(4*x^2 + 1)*z^4 - 4*x*(2*x - 1)*z^3 - 5*x*z^2 + 2*(2*x - 1)*z + 2. (see Theorem C in link)
G.f. y=A(x) satisfies:
0 = 8*y^4 + 4*(2*x + 1)*(2*x + 3)*y^3 - (x - 6)*(2*x + 1)^2*y^2 + (2*x + 1)^3*(18*x^2 - 16*x + 1)*y + x^2*(2*x + 1)^4*(27*x - 2).
0 = x^3*(2*x + 1)^4*(4*x^2 - 2*x + 1)*(108*x^2 - 304*x + 27)*(128*x^6 - 1504*x^5 + 5864*x^4 - 8282*x^3 + 4381*x^2 - 659*x + 60)*y'''' - x^2*(2*x + 1)^3*(417792*x^10 - 1973504*x^9 - 7891840*x^8 + 53958576*x^7 - 106786208*x^6 + 92663096*x^5 - 38721768*x^4 + 9604075*x^3 - 1447438*x^2 + 141966*x - 4860)*y''' + 3*x*(2*x + 1)^2*(163840*x^12 - 1929216*x^11 + 11348480*x^10 - 47888896*x^9 + 125855008*x^8 - 184580160*x^7 + 158611640*x^6 - 81013580*x^5 + 22892592*x^4 - 3821021*x^3 + 403960*x^2 - 23876*x + 120)*y'' - 12*(2*x + 1)*(163840*x^13 - 1888256*x^12 + 11294208*x^11 - 48430080*x^10 + 125093344*x^9 - 184709184*x^8 + 159190952*x^7 - 80413964*x^6 + 23140740*x^5 - 3792653*x^4 + 391233*x^3 - 28410*x^2 - 199*x + 30)*y' + 24*(163840*x^13 - 1847296*x^12 + 11198976*x^11 - 48855552*x^10 + 124699296*x^9 - 184627968*x^8 + 159583928*x^7 - 80114156*x^6 + 23238984*x^5 - 3787577*x^4 + 385076*x^3 - 30072*x^2 - 292*x + 40)*y.
a(n) ~ c / (sqrt(Pi) * n^(5/2) * r^n), where r = (76 - 7*sqrt(103))/54 and c = sqrt(3278181/(3125*(109592 + 10823*sqrt(103)))). - Vaclav Kotesovec, Aug 25 2018

A318102 Number of rooted 2-connected 4-regular maps on the projective plane, which may have loops, with n inner faces.

Original entry on oeis.org

5, 38, 199, 1466, 12365, 109700, 1003929, 9404402, 89690920, 867506788, 8486154214, 83790178300, 833805753167, 8352569222312, 84150924820499, 852039732062530, 8664839058268872, 88459350543053228, 906208005777385526, 9312350891307447116, 95963703215086597466, 991421114632619679480
Offset: 1

Views

Author

Gheorghe Coserea, Aug 19 2018

Keywords

Examples

			A(x) = 5*x + 38*x^2 + 199*x^3 + 1466*x^4 + 12365*x^5 + 109700*x^6 + ...
		

Crossrefs

Programs

  • PARI
    F = (1 - z + 2*z^3*x*(1 - x))/(2*z*(1 - z^2*x));
    G = x*(4*x^2 + 1)*z^4 - 4*x*(2*x - 1)*z^3 - 5*x*z^2 + 2*(2*x - 1)*z + 2;
    Z(N) = {
      my(z0=1+O('x^N), z1=0, n=1);
      while (n++,
        z1 = z0 - subst(G, 'z, z0)/subst(deriv(G, 'z), 'z, z0);
        if (z1 == z0, break()); z0 = z1);
      z0;
    };
    f(N) = subst((z + 2*z*F - 1)/(2*z^2*x), 'z, Z(N));
    Fp2(N) = {
      my(z=Z(N), f=f(N));
      ((1 - sqrt(1 - 4*z^2*x*f))/(x*z) + z*(z-3)/2 * f^2 + 2*(f - 1))/(2*f - 1);
    };
    Fp4(N) = (1 + 2*x)*(Fp2(N) - 1) + 3*subst(F, 'z, Z(N+2));
    seq(N) = Vec(Fp4(N+1));
    seq(22)
    /* test:
    system("wget https://oeis.org/A318102/a318102.txt");
    apply_diffop(p, s) = { \\ apply diffop p (encoded as Pol in Dx) to Ser s
      s=intformal(s);
      sum(n=0, poldegree(p, 'Dx), s=s'; polcoeff(p, n, 'Dx) * s);
    };
    0 == apply_diffop(read("a318102.txt"), Fp4(1001))
    */

Formula

G.f.: (1 + 2*x)*(Fp2 - 1) + 3*F, where Fp2 and F are given by the system of algebraic equations:
0 = x*(4*x^2 + 1)*z^4 - 4*x*(2*x - 1)*z^3 - 5*x*z^2 + 2*(2*x - 1)*z + 2,
F = (1 - z + 2*z^3*x*(1 - x))/(2*z*(1 - z^2*x)),
f = (z + 2*z*F - 1)/(2*z^2*x),
Fp2 = ((1 - sqrt(1 - 4*z^2*x*f))/(x*z) + z*(z-3)/2 * f^2 + 2*(f - 1))/(2*f - 1).
The initial coefficients of the solutions are:
z = 1 + 2*x + 6*x^2 + 34*x^3 + 254*x^4 + 2052*x^5 + 17332*x^6 + ...,
F = 2*x^2 + 5*x^3 + 20*x^4 + 114*x^5 + 758*x^6 + 5461*x^7 + 41668*x^8 + ...,
f = 1 + x + 6*x^2 + 37*x^3 + 262*x^4 + 2050*x^5 + 17064*x^6 + ...,
Fp2 = 1 + 5*x + 22*x^2 + 140*x^3 + 1126*x^4 + 9771*x^5 + 87884*x^6 + ...
(see Facts 2-5 and Theorem B in the link)
G.f. y=A(x) satisfies:
0 = 4096*x^7*(4*x^2 - 2*x + 1)^2*y^8 + 2048*x^6*(4*x^2 - 2*x + 1)^2*(36*x^2 + 16*x - 7)*y^7 + 128*x^5*(4*x^2 - 2*x + 1)*(8320*x^6 + 19648*x^5 - 1076*x^4 - 1804*x^3 + 1907*x^2 - 580*x + 126)*y^6 + 32*x^4*(4*x^2 - 2*x + 1)*(225280*x^7 + 444240*x^6 + 84688*x^5 - 29552*x^4 + 32044*x^3 - 9577*x^2 + 976*x - 280)*y^5 + x^3*(40239104*x^11 - 79837184*x^10 + 295013376*x^9 - 58917488*x^8 + 30598624*x^7 + 31536856*x^6 - 14288200*x^5 + 7449849*x^4 - 1791392*x^3 + 303304*x^2 - 15680*x + 2800)*y^4 + 2*x^2*(272629760*x^13 - 24282112*x^12 - 175736320*x^11 + 322666592*x^10 - 42540704*x^9 + 44400384*x^8 + 30919616*x^7 - 7960626*x^6 + 8259482*x^5 - 2256409*x^4 + 613344*x^3 - 92803*x^2 + 2512*x - 252)*y^3 + x*(4137222144*x^14 + 1879746560*x^13 - 1113429024*x^12 + 1342878720*x^11 + 65189712*x^10 + 10079664*x^9 + 147999470*x^8 - 45142196*x^7 + 25711384*x^6 - 6520084*x^5 + 2042177*x^4 - 392900*x^3 + 48476*x^2 - 1064*x + 49)*y^2 - 2*(1128267776*x^16 - 4335727616*x^15 - 6678567648*x^14 + 1061181280*x^13 - 2785972352*x^12 + 213096160*x^11 - 166061526*x^10 - 112334126*x^9 + 50212017*x^8 - 27194278*x^7 + 7091863*x^6 - 1701882*x^5 + 350358*x^4 - 36314*x^3 + 2951*x^2 - 44*x + 1)*y + x*(17448304640*x^16 - 38432538624*x^15 + 29298729744*x^14 - 1261398240*x^13 + 9372670936*x^12 + 6841726488*x^11 + 1476038993*x^10 + 1644370884*x^9 + 177903076*x^8 + 98892200*x^7 + 15461596*x^6 - 2656592*x^5 + 901090*x^4 - 145464*x^3 + 25339*x^2 - 364*x + 10).

A318103 Number of rooted 2-connected loopless 4-regular maps on the projective plane with n inner faces.

Original entry on oeis.org

6, 21, 138, 781, 4836, 30099, 191698, 1236024, 8063492, 53086930, 352249244, 2352800079, 15805224904, 106702428453, 723509453442, 4924851788720, 33638721268140, 230477992427450, 1583550831926508, 10907729315809642, 75307599054762424, 521026923863915206, 3611800088179535100
Offset: 2

Views

Author

Gheorghe Coserea, Aug 20 2018

Keywords

Examples

			A(x) = 6*x^2 + 21*x^3 + 138*x^4 + 781*x^5 + 4836*x^6 + 30099*x^7 + ...
		

Crossrefs

Programs

  • PARI
    F = (2*z^3*x^2 + (2*z^3 - 2*z)*x + (-z + 1))/(-2*z^3*x + 2*z);
    G = x*(4*x + 1)*z^4 + 4*x*z^3 - 5*x*z^2 - 2*z + 2;
    Z(N) = {
      my(z0=1+O('x^N), z1=0, n=1);
      while (n++,
        z1 = z0 - subst(G, 'z, z0)/subst(deriv(G, 'z), 'z, z0);
        if (z1 == z0, break()); z0 = z1);
      z0;
    };
    f(N) = subst((z - 1 + 2*z*x + 2*z*F)/(2*x*z^2), 'z, Z(N));
    Fp4(N) = {
      my(z=Z(N), f=f(N));
    ((1 - sqrt(1- 4*x*z^2*f))/(x*z) - z*f - x*(z*f)^3*(2 - f))/(2*f - 1) - 1;
    };
    seq(N) = Vec(Fp4(N+2));
    seq(23)
    /* test:
    system("wget https://oeis.org/A318103/a318103.txt");
    apply_diffop(p, s) = {
      s=intformal(s);
      sum(n=0, poldegree(p, 'Dx), s=s'; polcoeff(p, n, 'Dx) * s);
    };
    0 == apply_diffop(read("a318103.txt"), Fp4(1001))
    */

Formula

G.f.: ((1 - sqrt(1- 4*x*z^2*f))/(x*z) - z*f - x*(z*f)^3*(2 - f))/(2*f - 1) - 1, where z and f are given by the system of algebraic equations:
0 = x*(4*x + 1)*z^4 + 4*x*z^3 - 5*x*z^2 - 2*z + 2,
F = (2*z^3*x^2 + (2*z^3 - 2*z)*x + (-z + 1))/(-2*z^3*x + 2*z),
f = (z - 1 + 2*z*x + 2*z*F)/(2*x*z^2).
The initial coefficients of the solutions are:
z = 1 + 2*x^2 + 6*x^3 + 34*x^4 + 176*x^5 + 1004*x^6 + 5858*x^7 + ...
F = x^3 + 2*x^4 + 10*x^5 + 42*x^6 + 209*x^7 + 1066*x^8 + 5726*x^9 + ...
f = 1 + x + 2*x^2 + 9*x^3 + 42*x^4 + 222*x^5 + 1232*x^6 + 7137*x^7 + ...
(see Facts 6-7 and Theorem C in the link)
G.f. y=A(x) satisfies:
0 = 4096*x^7*(2*x + 1)^2*y^8 + 2048*x^6*(2*x + 1)^2*(16*x - 7)*y^7 + 128*x^5*(2*x + 1)*(1792*x^3 - 285*x^2 - 76*x + 126)*y^6 + 32*x^4*(2*x + 1)*(14336*x^4 - 2360*x^3 - 57*x^2 - 144*x - 280)*y^5 + x^3*(1146880*x^6 + 625920*x^5 + 282633*x^4 + 174368*x^3 + 44232*x^2 + 6720*x + 2800)*y^4 + 2*x^2*(2*x + 1)*(229376*x^6 + 108288*x^5 + 419113*x^4 + 53390*x^3 - 39619*x^2 + 1000*x - 252)*y^3 + x*(458752*x^8 + 740608*x^7 + 3399862*x^6 + 1371564*x^5 - 317093*x^4 - 58308*x^3 + 25400*x^2 - 672*x + 49)*y^2 + 2*(65536*x^9 + 162048*x^8 + 1258098*x^7 + 287981*x^6 - 86682*x^5 + 22504*x^4 + 5250*x^3 - 2026*x^2 + 36*x - 1)*y + x^2*(16384*x^7 + 58112*x^6 + 674825*x^5 + 33912*x^4 + 11954*x^3 + 23076*x^2 - 390*x + 12).
From Vaclav Kotesovec, Aug 25 2018: (Start)
a(n) ~ c1 * (196/27)^n / n^(5/4) * (1 + c2/n^(1/4) + c3/n^(1/2)), where
c1 = 7^(5/4) * Gamma(1/4) / (5^(5/4) * 3^(3/4) * Pi),
c2 = -17 * 7^(1/4) * sqrt(Pi) / (3^(7/4) * 5^(1/4) * Gamma(1/4)),
c3 = 71 * sqrt(7) * Pi / (2^(3/2) * sqrt(3) * 5^(3/2) * Gamma(1/4)^2). (End)

A006398 Number of sensed planar maps with n edges and without loops or isthmuses.

Original entry on oeis.org

1, 0, 1, 2, 4, 8, 29, 92, 403, 1846, 9239, 48028, 259567
Offset: 0

Views

Author

Keywords

References

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

Crossrefs

Cf. A006384, A006390, A006399 (unsensed), A099553 (rooted).

Extensions

a(9)-a(12) from Sean A. Irvine, Mar 29 2017
a(0)-a(1) prepended by Andrew Howroyd, Jan 16 2025

A006399 Number of unsensed planar maps with n edges and without loops or isthmuses.

Original entry on oeis.org

1, 0, 1, 2, 4, 8, 27, 76, 295, 1188, 5462, 26580, 138110
Offset: 0

Views

Author

Keywords

References

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

Crossrefs

Cf. A006385, A006391, A006398 (sensed), A099553 (rooted).

Extensions

a(9)-a(12) from Sean A. Irvine, Mar 29 2017
a(0)-a(1) prepended by Andrew Howroyd, Jan 16 2025
Showing 1-6 of 6 results.