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.

A375763 Irregular triangle read by rows, T(n,k) is the number of North-East lattice paths from (0,0) to (n,n+2) that stay weakly above y = x, with weight = k + A000217(n).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 2
7 2
8 1
9 1
10 1
11 3
12 4
13 5
14 4
15 4
16 3
17 2
18 1
19 1
20 1
21 4
22 7
23 10
24 11
25 11
26 11
27 9
28 8
29 6
30 5
31 3
32 2
33 1
34 1
35 1
36 5
37 11
38 18
39 24
40 27
41 30
42 29
43 28
44 25
45 23
46 19
47 16
48 12
49 10
50 7
51 5
52 3
53 2
54 1
55 1
56 1
57 6
58 16
59 30
60 46
61 59
62 71
63 78
64 81
65 81
66 78
67 74
68 67
69 60
70 52
71 46
72 37
73 31
74 24

List of values

[1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 3, 4, 5, 4, 4, 3, 2, 1, 1, 1, 4, 7, 10, 11, 11, 11, 9, 8, 6, 5, 3, 2, 1, 1, 1, 5, 11, 18, 24, 27, 30, 29, 28, 25, 23, 19, 16, 12, 10, 7, 5, 3, 2, 1, 1, 1, 6, 16, 30, 46, 59, 71, 78, 81, 81, 78, 74, 67, 60, 52, 46, 37, 31, 24]