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.

A208956 Triangular array read by rows. T(n,k) is the number of n-permutations that have at least k fixed points with n >= 1 and 1 <= k <= n.

Table of values

n a(n)
1 1
2 1
3 1
4 4
5 1
6 1
7 15
8 7
9 1
10 1
11 76
12 31
13 11
14 1
15 1
16 455
17 191
18 56
19 16
20 1
21 1
22 3186
23 1331
24 407
25 92
26 22
27 1
28 1
29 25487
30 10655
31 3235
32 771
33 141
34 29
35 1
36 1
37 229384
38 95887
39 29143
40 6883
41 1339
42 205
43 37
44 1
45 1
46 2293839
47 958879
48 291394
49 68914
50 13264
51 2176
52 286
53 46
54 1
55 1

List of values

[1, 1, 1, 4, 1, 1, 15, 7, 1, 1, 76, 31, 11, 1, 1, 455, 191, 56, 16, 1, 1, 3186, 1331, 407, 92, 22, 1, 1, 25487, 10655, 3235, 771, 141, 29, 1, 1, 229384, 95887, 29143, 6883, 1339, 205, 37, 1, 1, 2293839, 958879, 291394, 68914, 13264, 2176, 286, 46, 1, 1]