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.

A329596 A variation of Recamán's sequence (A005132): a(0) = 0; a(1) = 1; a(2) = 3; for n > 2, a(n) = sopfr(a(n-1))- sopfr(n) if positive and not already in the sequence, otherwise a(n) = sopfr(a(n-1)) + sopfr(n).

Table of values

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

List of values

[0, 1, 3, 6, 9, 11, 16, 15, 2, 8, 13, 24, 16, 21, 19, 27, 17, 34, 27, 28, 20, 19, 32, 33, 5, 15, 23, 14, 20, 38, 31, 62, 43, 29, 10, 19, 29, 66, 37, 53, 42, 53, 41, 84, 29, 18, 33, 61, 50, 26, 27, 29, 12, 60, 23, 7, 20, 31, 62, 92, 39, 77, 51, 33, 26, 33, 30, 77, 39, 42]