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.

A288033 Number of (undirected) paths in the n X n king graph.

Original entry on oeis.org

0, 30, 5148, 6014812, 57533191444, 4956907379126694, 3954100866385811897908, 29986588563791584765930866780, 2187482261973324160097873804506155572, 1550696105068168200375810546149511240714556526
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

Crossrefs

Extensions

a(5)-a(10) from Andrew Howroyd, Jun 10 2017

A236753 Number of simple (non-intersecting) directed paths on the grid graph P_n X P_n.

Original entry on oeis.org

1, 28, 653, 28512, 3060417, 873239772, 687430009069, 1532025110398168, 9829526954625359697, 183563561823425961932572, 10056737067604248527218979485, 1626248896102138091401810358337184
Offset: 1

Views

Author

Jaimal Ichharam, Jan 30 2014

Keywords

Comments

This is the number of directed paths on P_n X P_n of any length and also includes one zero length path per vertex. - Andrew Howroyd, May 27 2017

Examples

			For n=2 there are 4 zero length paths (one for each vertex), 8 paths with 1 one edge, 8 paths with 2 edges and 8 paths with 3 edges, so a(2)=28. - _Andrew Howroyd_, May 27 2017
		

Crossrefs

Cf. A236690 (includes diagonal edges).

Formula

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

Extensions

a(6) corrected and a(8) added from Jaimal Ichharam, Feb 13 2014
a(6)-a(8) corrected and a(9)-a(12) from Andrew Howroyd, May 27 2017
Showing 1-2 of 2 results.