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.

A265436 a(n) is the least m (1 <= m <= n) such that the set of pairs (x, y) of distinct terms from [m, n] can be ordered in such a way that the corresponding sums (x+y) and products (x*y) are monotonic.

Table of values

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

List of values

[1, 1, 1, 1, 2, 2, 3, 3, 4, 5, 6, 6, 7, 8, 8, 9, 10, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 19, 20, 20, 21, 22, 23, 24, 24, 25, 26, 27, 28, 29, 30, 30, 31, 32, 33, 34, 35, 35, 36, 37, 38, 39, 40, 41, 42, 42, 43, 44, 45, 46, 47, 48, 48, 49, 50, 51, 52, 53, 54, 55]