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.

A360847 Number of dominating induced trees in the n X n grid graph.

Original entry on oeis.org

1, 8, 65, 1280, 78981, 14605388, 7904828158, 12456744197696, 57118103869618858, 760896261783236975004, 29416443122724544970455433, 3297715940113139272931793598648, 1071333966021766251746119497973623975, 1008129126269380724757869194465038817386728
Offset: 1

Views

Author

Andrew Howroyd, Feb 23 2023

Keywords

Comments

A dominating induced tree in a graph is an acyclic connected induced subgraph whose vertices are a dominating set.

Links

  • Eric Weisstein's World of Mathematics, Grid Graph.

Crossrefs

Main diagonal of A360846.
Cf. A287690 (connected dominating sets), A360203 (induced trees).

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.