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.

A026009 Triangular array T read by rows: T(n,0) = 1 for n >= 0; T(1,1) = 1; and for n >= 2, T(n,k) = T(n-1,k-1) + T(n-1,k) for k = 1,2,...,[(n+1)/2]; T(n,n/2 + 1) = T(n-1,n/2) if n is even.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 3
8 3
9 1
10 4
11 6
12 3
13 1
14 5
15 10
16 9
17 1
18 6
19 15
20 19
21 9
22 1
23 7
24 21
25 34
26 28
27 1
28 8
29 28
30 55
31 62
32 28
33 1
34 9
35 36
36 83
37 117
38 90
39 1
40 10
41 45
42 119
43 200
44 207
45 90
46 1
47 11
48 55
49 164
50 319
51 407
52 297
53 1
54 12
55 66
56 219
57 483
58 726
59 704
60 297
61 1
62 13
63 78
64 285
65 702
66 1209
67 1430
68 1001
69 1
70 14
71 91
72 363
73 987
74 1911
75 2639
76 2431
77 1001

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 4, 6, 3, 1, 5, 10, 9, 1, 6, 15, 19, 9, 1, 7, 21, 34, 28, 1, 8, 28, 55, 62, 28, 1, 9, 36, 83, 117, 90, 1, 10, 45, 119, 200, 207, 90, 1, 11, 55, 164, 319, 407, 297, 1, 12, 66, 219, 483, 726, 704, 297, 1, 13, 78, 285, 702, 1209, 1430, 1001, 1, 14, 91, 363, 987, 1911, 2639, 2431, 1001]