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-2 of 2 results.

A380241 Array read by antidiagonals: T(n,k) is the number of rooted (2k)-regular planar maps with n vertices, n >= 0, k >= 0.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 5, 9, 1, 1, 1, 14, 100, 54, 1, 1, 1, 42, 1225, 3000, 378, 1, 1, 1, 132, 15876, 171500, 110000, 2916, 1, 1, 1, 429, 213444, 10001880, 30012500, 4550000, 24057, 1, 1, 1, 1430, 2944656, 591666768, 7981500240, 5987493750, 204000000, 208494, 1, 1
Offset: 0

Views

Author

Andrew Howroyd, Jan 22 2025

Keywords

Comments

The zeroth column is included by convention only for consistency with the first row sequences.
The case for regular planar maps of odd valency is more complicated and without simple closed form formulas, so not presented in this sequence. See the references for additional information.

Examples

			Array begins:
====================================================================
n\k | 0  1      2          3               4                   5 ...
----+---------------------------------------------------------------
  0 | 1  1      1          1               1                   1 ...
  1 | 1  1      2          5              14                  42 ...
  2 | 1  1      9        100            1225               15876 ...
  3 | 1  1     54       3000          171500            10001880 ...
  4 | 1  1    378     110000        30012500          7981500240 ...
  5 | 1  1   2916    4550000      5987493750       7304332956480 ...
  6 | 1  1  24057  204000000   1302227368750    7310748066293952 ...
  7 | 1  1 208494 9690000000 301107909375000 7794097754539041792 ...
  ...
		

Crossrefs

Columns 0..3 are A000012 twice, A000168, A380242.
Rows 0..3 are A000012, A000108, A060150, A380243.
Cf. A269920.

Programs

  • PARI
    T(n,k)=if(k==0, 1, 2*binomial(2*k-1,k)^n*(n*k)!/(n!*(n*k - n + 2)!))

Formula

T(n,k) = 2*binomial(2*k-1, k)^n*(n*k)!/(n!*(n*k - n + 2)!) for k > 0.

A380243 Number of rooted 2n-regular planar maps with 3 vertices.

Original entry on oeis.org

1, 54, 3000, 171500, 10001880, 591666768, 35371207872, 2131746903000, 129299660919000, 7883256659941520, 482689850761774656, 29661047546558142624, 1828220386252351000000, 112982297841774018000000, 6998159395715622920640000, 434337846995341921726638000, 27004842919501042631643927000
Offset: 1

Views

Author

Andrew Howroyd, Jan 22 2025

Keywords

Comments

There are no odd valent regular planar maps with 3 vertices.

Crossrefs

Row n=3 of A380241.

Programs

  • PARI
    a(n) = n*binomial(2*n-1, n)^3

Formula

a(n) = n*binomial(2*n-1, n)^3.
a(n) = n*A002897(n - 1).
Showing 1-2 of 2 results.