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.

A288032 Number of (undirected) paths in the n X n grid graph.

Original entry on oeis.org

0, 12, 322, 14248, 1530196, 436619868, 343715004510, 766012555199052, 4914763477312679808, 91781780911712980966236, 5028368533802124263609489682, 813124448051069045700905179168520
Offset: 1

Views

Author

Eric W. Weisstein, Jun 04 2017

Keywords

Comments

Paths of length zero are not counted here. - Andrew Howroyd, Jun 10 2017

Links

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

Crossrefs

Main diagonal of A288518.
Cf. A236753, A288033, A288148, A007764, A121785, A120443.

Extensions

a(6)-a(12) from Andrew Howroyd, Jun 10 2017

A236690 Number of simple directed paths on an n X n king graph.

Original entry on oeis.org

1, 64, 10305, 12029640, 115066382913, 9913814758253424, 7908201732771623795865, 59973177127583169531861733624, 4374964523946648320195747609012311225, 3101392210136336400751621092299022481429113152
Offset: 1

Views

Author

Jaimal Ichharam, Jan 30 2014

Keywords

Comments

This is the number (assuming each character is unique) of strings that are possible in an n X n Boggle grid.
This sequence gives the number of directed paths. Paths may start and end on any vertex and may be of any length. Paths of length zero are counted here. - Andrew Howroyd, May 12 2017

Links

  • Eric Weisstein's World of Mathematics, King Graph

Crossrefs

Cf. A236753 for a simpler version of the problem without diagonal edges.
Cf. A288033, A140518, A158651.

Formula

a(n) = 2*A288033(n) + n^2. - Andrew Howroyd, Jun 10 2017

Extensions

a(5) from Jaimal Ichharam, Feb 12 2014
Named edited and a(6)-a(10) from Andrew Howroyd, May 12 2017
Showing 1-2 of 2 results.

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

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