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.

A065078 Triangle read by rows: a(n,m) = T[n,m,m] where T[i,j,k] is the 3-dimensional pyramid defined by T[n,m,0]=1 and 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].

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 1
7 3
8 10
9 18
10 1
11 4
12 22
13 79
14 162
15 1
16 5
17 40
18 220
19 831
20 1851
21 1
22 6
23 65
24 492
25 2681
26 10488
27 24661
28 1
29 7
30 98
31 962
32 6883
33 37367
34 149743
35 365613
36 1
37 8
38 140
39 1715
40 15318
41 105731
42 573051
43 2336243
44 5863881
45 1
46 9
47 192
48 2856
49 30840
50 258604
51 1742770

List of values

[1, 1, 1, 1, 2, 3, 1, 3, 10, 18, 1, 4, 22, 79, 162, 1, 5, 40, 220, 831, 1851, 1, 6, 65, 492, 2681, 10488, 24661, 1, 7, 98, 962, 6883, 37367, 149743, 365613, 1, 8, 140, 1715, 15318, 105731, 573051, 2336243, 5863881, 1, 9, 192, 2856, 30840, 258604, 1742770]