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.

A051145 a(0)=0, a(1)=1, 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 0
1 1
2 2
3 4
4 3
5 8
6 4
7 9
8 6
9 16
10 7
11 24
12 32
13 25
14 34
15 28
16 35
17 64
18 36
19 65
20 38
21 72
22 39
23 80
24 40
25 81
26 42
27 84
28 43
29 128
30 44
31 129
32 46
33 144
34 47
35 192
36 48
37 193
38 50
39 196
40 51
41 200
42 52
43 201
44 54
45 256
46 55
47 264
48 64
49 265
50 66
51 268
52 67
53 272
54 68
55 273
56 70
57 280
58 71
59 288
60 72
61 289
62 74
63 292
64 75
65 304

List of values

[0, 1, 2, 4, 3, 8, 4, 9, 6, 16, 7, 24, 32, 25, 34, 28, 35, 64, 36, 65, 38, 72, 39, 80, 40, 81, 42, 84, 43, 128, 44, 129, 46, 144, 47, 192, 48, 193, 50, 196, 51, 200, 52, 201, 54, 256, 55, 264, 64, 265, 66, 268, 67, 272, 68, 273, 70, 280, 71, 288, 72, 289, 74, 292, 75, 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.