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.

A085688 a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.

Table of values

n a(n)
1 11
2 8
3 6
4 12
5 9
6 7
7 14
8 11
9 9
10 18
11 15
12 13
13 26
14 23
15 21
16 42
17 39
18 37
19 74
20 71
21 69
22 138
23 135
24 133
25 266
26 263
27 261
28 522
29 519
30 517
31 1034
32 1031
33 1029
34 2058
35 2055
36 2053
37 4106
38 4103
39 4101
40 8202
41 8199
42 8197
43 16394
44 16391
45 16389
46 32778
47 32775
48 32773
49 65546
50 65543
51 65541
52 131082

List of values

[11, 8, 6, 12, 9, 7, 14, 11, 9, 18, 15, 13, 26, 23, 21, 42, 39, 37, 74, 71, 69, 138, 135, 133, 266, 263, 261, 522, 519, 517, 1034, 1031, 1029, 2058, 2055, 2053, 4106, 4103, 4101, 8202, 8199, 8197, 16394, 16391, 16389, 32778, 32775, 32773, 65546, 65543, 65541, 131082]