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.

A355242 T(w,h) is the minimum integer slope >= 1 that can be chosen as orientation of a w X h rectangle such that the upper bound for the minimum number of covered grid points A354702(w,d) can be achieved by a suitable translation of the rectangle, where T(w,h) and A354702 are triangles read by rows. T(w,h) = -1 if no integer slope satisfying this condition exists.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 3, 3, 1, 2, 1, 2, 1, 1, 2, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1]