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.

A282025 a(r) is the maximum number of secretaries for which the first r should be rejected, if selecting the one with the highest or lowest ranking are both considered a success.

Table of values

n a(n)
0 3
1 8
2 13
3 18
4 23
5 27
6 32
7 37
8 42
9 47
10 52
11 57
12 62
13 67
14 72
15 77
16 82
17 86
18 91
19 96
20 101
21 106
22 111
23 116
24 121
25 126
26 131
27 136
28 141
29 146
30 150
31 155
32 160
33 165
34 170
35 175
36 180
37 185
38 190
39 195
40 200
41 205
42 210
43 214
44 219
45 224
46 229
47 234
48 239
49 244
50 249
51 254
52 259
53 264
54 269
55 273
56 278
57 283

List of values

[3, 8, 13, 18, 23, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 86, 91, 96, 101, 106, 111, 116, 121, 126, 131, 136, 141, 146, 150, 155, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 214, 219, 224, 229, 234, 239, 244, 249, 254, 259, 264, 269, 273, 278, 283]