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.

A349839 Triangle T(n,k) built by placing all ones on the left edge, [1,0,0,0] repeated on the right edge, and filling the body using the Pascal recurrence T(n,k) = T(n-1,k) + T(n-1,k-1).

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 1
9 0
10 1
11 3
12 3
13 1
14 1
15 1
16 4
17 6
18 4
19 2
20 0
21 1
22 5
23 10
24 10
25 6
26 2
27 0
28 1
29 6
30 15
31 20
32 16
33 8
34 2
35 0
36 1
37 7
38 21
39 35
40 36
41 24
42 10
43 2
44 1
45 1
46 8
47 28
48 56
49 71
50 60
51 34
52 12
53 3
54 0
55 1
56 9
57 36
58 84
59 127
60 131
61 94
62 46
63 15
64 3
65 0
66 1
67 10
68 45
69 120
70 211
71 258
72 225
73 140
74 61
75 18
76 3
77 0
78 1
79 11
80 55
81 165
82 331
83 469
84 483
85 365
86 201
87 79
88 21
89 3
90 1

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 3, 1, 1, 1, 4, 6, 4, 2, 0, 1, 5, 10, 10, 6, 2, 0, 1, 6, 15, 20, 16, 8, 2, 0, 1, 7, 21, 35, 36, 24, 10, 2, 1, 1, 8, 28, 56, 71, 60, 34, 12, 3, 0, 1, 9, 36, 84, 127, 131, 94, 46, 15, 3, 0, 1, 10, 45, 120, 211, 258, 225, 140, 61, 18, 3, 0, 1, 11, 55, 165, 331, 469, 483, 365, 201, 79, 21, 3, 1]