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.

A316673 Number of paths from (0,0,0) to (n,n,n) that always move closer to (n,n,n).

Table of values

n a(n)
0 1
1 13
2 818
3 64324
4 5592968
5 515092048
6 49239783968
7 4831678931008
8 483371425775744
9 49083260519243008
10 5043379069021557248
11 523221884090930480128
12 54715789513061864081408
13 5760456190025868833542144
14 609948004367577499751948288
15 64905519628343663567453569024

List of values

[1, 13, 818, 64324, 5592968, 515092048, 49239783968, 4831678931008, 483371425775744, 49083260519243008, 5043379069021557248, 523221884090930480128, 54715789513061864081408, 5760456190025868833542144, 609948004367577499751948288, 64905519628343663567453569024]

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

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