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.

A079051 Recamán variation: a(0) = 0; for n >= 1, a(n) = a(n-1) - f(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + f(n), where f(n) = floor(sqrt(n)) (A000196).

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 5
5 7
6 9
7 11
8 13
9 10
10 13
11 16
12 19
13 22
14 25
15 28
16 24
17 20
18 24
19 28
20 32
21 36
22 40
23 44
24 48
25 43
26 38
27 33
28 38
29 43
30 48
31 53
32 58
33 63
34 68
35 73
36 67
37 61
38 55
39 49
40 55
41 61
42 67
43 73
44 79
45 85
46 91
47 97
48 103
49 96
50 89
51 82
52 75
53 82
54 89
55 96
56 103
57 110
58 117
59 124
60 131
61 138
62 145
63 152
64 144
65 136
66 128
67 120

List of values

[0, 1, 2, 3, 5, 7, 9, 11, 13, 10, 13, 16, 19, 22, 25, 28, 24, 20, 24, 28, 32, 36, 40, 44, 48, 43, 38, 33, 38, 43, 48, 53, 58, 63, 68, 73, 67, 61, 55, 49, 55, 61, 67, 73, 79, 85, 91, 97, 103, 96, 89, 82, 75, 82, 89, 96, 103, 110, 117, 124, 131, 138, 145, 152, 144, 136, 128, 120]