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.

A065058 Number of paths to T(n,n,n) with T(i,j,k)= 0 if j>i or k>j and T(i,j,k) = T(i-1,j,k) + T(i,j-1,k) + T(i,j,k-1) and T(i,j,0) = 1.

Table of values

n a(n)
0 1
1 1
2 3
3 18
4 162
5 1851
6 24661
7 365613
8 5863881
9 99895425
10 1785024645
11 33156724734
12 635961987570
13 12531882072719
14 252701147866029
15 5198011293931270
16 108793300411597194
17 2312049376195527621
18 49804793378882733343
19 1085910951385068915212
20 23934948368968158240960

List of values

[1, 1, 3, 18, 162, 1851, 24661, 365613, 5863881, 99895425, 1785024645, 33156724734, 635961987570, 12531882072719, 252701147866029, 5198011293931270, 108793300411597194, 2312049376195527621, 49804793378882733343, 1085910951385068915212, 23934948368968158240960]

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

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