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.

A052509 Knights-move Pascal triangle: T(n,k), n >= 0, 0 <= k <= n; T(n,0) = T(n,n) = 1, T(n,k) = T(n-1,k) + T(n-2,k-1) for k = 1,2,...,n-1, n >= 2.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 4, 4, 2, 1, 1, 5, 7, 4, 2, 1, 1, 6, 11, 8, 4, 2, 1, 1, 7, 16, 15, 8, 4, 2, 1, 1, 8, 22, 26, 16, 8, 4, 2, 1, 1, 9, 29, 42, 31, 16, 8, 4, 2, 1, 1, 10, 37, 64, 57, 32, 16, 8, 4, 2, 1, 1, 11, 46, 93, 99, 63, 32, 16, 8, 4, 2, 1]