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.

A172237 T(n,k) = T(n-1,k) + k*T(n-2,k) for k >= 1 and n >= 3 with T(0,k) = 0 and T(1,k) = T(2,k) = 1 for all k >= 1; array T(n,k), read by descending antidiagonals, with n >= 0 and k >= 1.

Table of values

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

List of values

[0, 0, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 3, 3, 0, 1, 1, 4, 5, 5, 0, 1, 1, 5, 7, 11, 8, 0, 1, 1, 6, 9, 19, 21, 13, 0, 1, 1, 7, 11, 29, 40, 43, 21, 0, 1, 1, 8, 13, 41, 65, 97, 85, 34, 0, 1, 1, 9, 15, 55, 96, 181, 217, 171, 55, 0, 1, 1, 10, 17, 71, 133, 301, 441, 508, 341, 89, 0, 1, 1, 11]