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.

A057926 a(0) = 1, a(1) = 3, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.

Table of values

n a(n)
0 1
1 3
2 4
3 8
4 5
5 10
6 16
7 11
8 20
9 32
10 21
11 34
12 24
13 35
14 28
15 64
16 29
17 66
18 32
19 67
20 36
21 72
22 37
23 74
24 48
25 75
26 52
27 128
28 53
29 130
30 56
31 131
32 60
33 192
34 61
35 194
36 256
37 195
38 260
39 200
40 261
41 202
42 272
43 203
44 276
45 224
46 277
47 226
48 280
49 227
50 284
51 512
52 285
53 514
54 288
55 515
56 292
57 520
58 293
59 522
60 304

List of values

[1, 3, 4, 8, 5, 10, 16, 11, 20, 32, 21, 34, 24, 35, 28, 64, 29, 66, 32, 67, 36, 72, 37, 74, 48, 75, 52, 128, 53, 130, 56, 131, 60, 192, 61, 194, 256, 195, 260, 200, 261, 202, 272, 203, 276, 224, 277, 226, 280, 227, 284, 512, 285, 514, 288, 515, 292, 520, 293, 522, 304]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.