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.

A069203 a(1)=0 a(2)=3 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=a(n+1)+a(n) otherwise.

Table of values

n a(n)
1 0
2 3
3 1
4 4
5 5
6 3
7 8
8 11
9 19
10 10
11 29
12 13
13 14
14 9
15 23
16 32
17 55
18 29
19 28
20 19
21 47
22 22
23 23
24 15
25 38
26 53
27 91
28 48
29 139
30 187
31 326
32 171
33 497
34 668
35 1165
36 611
37 592
38 401
39 331
40 244
41 575
42 273
43 848
44 1121
45 1969
46 1030
47 2999
48 1343
49 4342
50 1895
51 2079
52 3974
53 6053
54 10027
55 5360
56 5129

List of values

[0, 3, 1, 4, 5, 3, 8, 11, 19, 10, 29, 13, 14, 9, 23, 32, 55, 29, 28, 19, 47, 22, 23, 15, 38, 53, 91, 48, 139, 187, 326, 171, 497, 668, 1165, 611, 592, 401, 331, 244, 575, 273, 848, 1121, 1969, 1030, 2999, 1343, 4342, 1895, 2079, 3974, 6053, 10027, 5360, 5129]