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.

A069196 a(1)=1, a(2)=3; for n>1, 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))/2 if (a(n+1)+a(n)==0 (mod 2)); and a(n+2)=a(n+1)+a(n) otherwise.

Table of values

n a(n)
1 1
2 3
3 2
4 5
5 7
6 4
7 11
8 5
9 8
10 13
11 7
12 10
13 17
14 9
15 13
16 11
17 8
18 19
19 9
20 14
21 23
22 37
23 20
24 19
25 13
26 16
27 29
28 15
29 22
30 37
31 59
32 32
33 91
34 41
35 44
36 85
37 43
38 64
39 107
40 57
41 82
42 139
43 221
44 120
45 341
46 461
47 401
48 431
49 416
50 847
51 421
52 634
53 1055
54 563
55 809
56 686
57 1495
58 727
59 1111
60 919
61 1015
62 967
63 991

List of values

[1, 3, 2, 5, 7, 4, 11, 5, 8, 13, 7, 10, 17, 9, 13, 11, 8, 19, 9, 14, 23, 37, 20, 19, 13, 16, 29, 15, 22, 37, 59, 32, 91, 41, 44, 85, 43, 64, 107, 57, 82, 139, 221, 120, 341, 461, 401, 431, 416, 847, 421, 634, 1055, 563, 809, 686, 1495, 727, 1111, 919, 1015, 967, 991]