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.

A063733 A variant of Recamán's sequence: a(0)=1, a(n) = a(n-1)-(n-1) if positive and new, else a(n) = a(n-1)+(n-1).

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 7
5 3
6 8
7 14
8 21
9 13
10 22
11 12
12 23
13 11
14 24
15 10
16 25
17 9
18 26
19 44
20 63
21 43
22 64
23 42
24 19
25 43
26 18
27 44
28 17
29 45
30 16
31 46
32 15
33 47
34 80
35 114
36 79
37 115
38 78
39 40
40 79
41 39
42 80
43 38
44 81
45 37
46 82
47 36
48 83
49 35
50 84
51 34
52 85
53 33
54 86
55 32
56 87
57 31
58 88
59 30
60 89
61 29
62 90
63 28
64 91
65 27

List of values

[1, 1, 2, 4, 7, 3, 8, 14, 21, 13, 22, 12, 23, 11, 24, 10, 25, 9, 26, 44, 63, 43, 64, 42, 19, 43, 18, 44, 17, 45, 16, 46, 15, 47, 80, 114, 79, 115, 78, 40, 79, 39, 80, 38, 81, 37, 82, 36, 83, 35, 84, 34, 85, 33, 86, 32, 87, 31, 88, 30, 89, 29, 90, 28, 91, 27]

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

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