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.

A135690 a(n) = a(n-2) - (a(n-1) - a(n-2)) if (n mod 2) = 0, otherwise a(n) = a(n-1) - (a(n-3) - a(n-4)), with a(0) = 0, a(1) = 1, a(2) = -1, a(3) = 2.

Table of values

n a(n)
0 0
1 1
2 -1
3 2
4 -4
5 -2
6 -6
7 0
8 -12
9 -8
10 -16
11 -4
12 -28
13 -20
14 -36
15 -12
16 -60
17 -44
18 -76
19 -28
20 -124
21 -92
22 -156
23 -60
24 -252
25 -188
26 -316
27 -124
28 -508
29 -380
30 -636
31 -252
32 -1020
33 -764
34 -1276
35 -508
36 -2044
37 -1532
38 -2556
39 -1020
40 -4092
41 -3068
42 -5116
43 -2044
44 -8188
45 -6140
46 -10236
47 -4092
48 -16380
49 -12284
50 -20476

List of values

[0, 1, -1, 2, -4, -2, -6, 0, -12, -8, -16, -4, -28, -20, -36, -12, -60, -44, -76, -28, -124, -92, -156, -60, -252, -188, -316, -124, -508, -380, -636, -252, -1020, -764, -1276, -508, -2044, -1532, -2556, -1020, -4092, -3068, -5116, -2044, -8188, -6140, -10236, -4092, -16380, -12284, -20476]