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.

A071803 Number of paths in the lattice [0..n] X [0..n] X [0..n] which do not pass through the point (floor(n/2), floor(n/2), floor(n/2)). Number of paths through a lattice containing a "hole".

Table of values

n a(n)
2 54
3 1140
4 26550
5 605556
6 14330736
7 340860960
8 8264889270
9 201651836100
10 4978317147804
11 123546256876224
12 3090501687886704
13 77632745316063840
14 1961313438507566400
15 49717549985405892480
16 1265749551338006549430
17 32312920048897640674500
18 827693426702217868006500

List of values

[54, 1140, 26550, 605556, 14330736, 340860960, 8264889270, 201651836100, 4978317147804, 123546256876224, 3090501687886704, 77632745316063840, 1961313438507566400, 49717549985405892480, 1265749551338006549430, 32312920048897640674500, 827693426702217868006500]

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

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