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.

A178249 Table T(n,k) counts the involutions of n with longest increasing contiguous subsequence of length k.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 6
9 2
10 1
11 1
12 14
13 8
14 2
15 1
16 1
17 37
18 27
19 8
20 2
21 1
22 1
23 96
24 94
25 30
26 8
27 2
28 1
29 1
30 270
31 338
32 114
33 30
34 8
35 2
36 1
37 1
38 777
39 1237
40 446
41 118
42 30
43 8
44 2
45 1
46 1
47 2370
48 4684
49 1809
50 473
51 118
52 30
53 8
54 2
55 1
56 1
57 7450
58 18142
59 7502
60 1964
61 478
62 118
63 30
64 8
65 2
66 1
67 1
68 24485
69 72524
70 32093
71 8414
72 1998
73 478
74 118
75 30
76 8
77 2
78 1

List of values

[1, 1, 1, 1, 2, 1, 1, 6, 2, 1, 1, 14, 8, 2, 1, 1, 37, 27, 8, 2, 1, 1, 96, 94, 30, 8, 2, 1, 1, 270, 338, 114, 30, 8, 2, 1, 1, 777, 1237, 446, 118, 30, 8, 2, 1, 1, 2370, 4684, 1809, 473, 118, 30, 8, 2, 1, 1, 7450, 18142, 7502, 1964, 478, 118, 30, 8, 2, 1, 1, 24485, 72524, 32093, 8414, 1998, 478, 118, 30, 8, 2, 1]