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.

A358481 a(n) is the number of different pairs of shortest grid paths joining two opposite corners in opposite order in an n X n X n grid without having middle point on their paths as a common point.

Table of values

n a(n)
1 30
2 6218
3 2658432
4 1054788750
5 552306591900
6 269380692717696
7 155175092086118400
8 83798883891736779150
9 50885239237727996887500
10 29198209396114625497699068
11 18332853214682572877389897728
12 10951674446687597386319569942656
13 7036938452279110885561897815723264
14 4325988198220149508865311059521280000

List of values

[30, 6218, 2658432, 1054788750, 552306591900, 269380692717696, 155175092086118400, 83798883891736779150, 50885239237727996887500, 29198209396114625497699068, 18332853214682572877389897728, 10951674446687597386319569942656, 7036938452279110885561897815723264, 4325988198220149508865311059521280000]