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.

A343873 Triangle read by rows: T(n,k) is the number of unlabeled connected planar graphs with n edges and k nodes (n >= 0, 1 <= k <= n + 1).

Original entry on oeis.org

1, 0, 1, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 2, 3, 0, 0, 0, 1, 5, 6, 0, 0, 0, 1, 5, 13, 11, 0, 0, 0, 0, 4, 19, 33, 23, 0, 0, 0, 0, 2, 22, 67, 89, 47, 0, 0, 0, 0, 1, 19, 107, 236, 240, 106, 0, 0, 0, 0, 0, 13, 130, 486, 797, 657, 235, 0, 0, 0, 0, 0, 5, 130, 804, 2075, 2678, 1806, 551
Offset: 0

Views

Author

Andrew Howroyd, May 06 2021

Keywords

Comments

First differs from A054923 in row n=9.
Terms may be computed using the tools geng and planarg in nauty.

Examples

			Triangle begins (n edges >= 0, k vertices >= 1):
  1;
  0, 1;
  0, 0, 1;
  0, 0, 1, 2;
  0, 0, 0, 2, 3;
  0, 0, 0, 1, 5,  6;
  0, 0, 0, 1, 5, 13,  11;
  0, 0, 0, 0, 4, 19,  33,  23;
  0, 0, 0, 0, 2, 22,  67,  89,  47;
  0, 0, 0, 0, 1, 19, 107, 236, 240, 106;
  0, 0, 0, 0, 0, 13, 130, 486, 797, 657, 235;
  ...
		

Crossrefs

Row sums are A046091.
Column sums are A003094.
Main diagonal is A000055.
Subsequent diagonals are A001429, A001435, A001436 (same as for not necessarily planar graphs).
Cf. A049334 (transpose), A054923, A343870.

Programs

  • nauty
    geng -c $k $n:$n | planarg -q | countg -q # Georg Grasegger, Jul 06 2023