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.

A334149 a(n) is the number of terms required beyond the starting value n before a value larger than n first appears when following the same rules as Recamán's sequence A005132 but starting at n instead of 0.

Table of values

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

List of values

[1, 2, 2, 4, 5, 5, 5, 7, 9, 10, 6, 8, 10, 12, 14, 8, 9, 11, 13, 15, 17, 9, 11, 13, 14, 16, 18, 20, 20, 12, 14, 16, 17, 19, 21, 23, 23, 14, 15, 17, 19, 21, 22, 24, 26, 26, 30, 34, 18, 20, 22, 24, 26, 28, 29, 29, 33, 37, 37, 21, 23, 25, 27, 29, 31, 33, 33, 36, 19, 40, 44, 27, 26, 28]