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.

A050177 T(n,k)=M0(n,k,f(n,k)), where M0 is given by A050176 and f(n,k) is the next-to-least t for which M0(n,k,t) is not 0.

Table of values

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

List of values

[1, 1, 1, 1, 3, 1, 1, 4, 4, 1, 1, 5, 9, 5, 1, 1, 6, 14, 14, 6, 1, 1, 7, 20, 28, 20, 7, 1, 1, 8, 27, 48, 48, 27, 8, 1, 1, 9, 35, 75, 90, 75, 35, 9, 1, 1, 10, 44, 110, 165, 165, 110, 44, 10, 1, 1, 11, 54, 154, 275, 297, 275, 154, 54, 11, 1, 1, 12, 65, 208, 429, 572, 572]