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.

A083239 First order recursion: a(0) = 1; a(n) = phi(n) - a(n-1) = A000010(n) - a(n-1).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 3
6 -1
7 7
8 -3
9 9
10 -5
11 15
12 -11
13 23
14 -17
15 25
16 -17
17 33
18 -27
19 45
20 -37
21 49
22 -39
23 61
24 -53
25 73
26 -61
27 79
28 -67
29 95
30 -87
31 117
32 -101
33 121
34 -105
35 129
36 -117
37 153
38 -135
39 159
40 -143
41 183
42 -171
43 213
44 -193
45 217
46 -195
47 241
48 -225
49 267
50 -247
51 279
52 -255
53 307
54 -289
55 329
56 -305
57 341
58 -313
59 371
60 -355
61 415
62 -385
63 421
64 -389
65 437
66 -417

List of values

[1, 0, 1, 1, 1, 3, -1, 7, -3, 9, -5, 15, -11, 23, -17, 25, -17, 33, -27, 45, -37, 49, -39, 61, -53, 73, -61, 79, -67, 95, -87, 117, -101, 121, -105, 129, -117, 153, -135, 159, -143, 183, -171, 213, -193, 217, -195, 241, -225, 267, -247, 279, -255, 307, -289, 329, -305, 341, -313, 371, -355, 415, -385, 421, -389, 437, -417]