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.

A104647 a(n) = a(n-1) mod n + a(n-2) mod n; a(0) = 0, a(1) = 1.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 3
5 5
6 8
7 6
8 6
9 12
10 8
11 9
12 17
13 13
14 16
15 14
16 14
17 28
18 24
19 14
20 18
21 32
22 28
23 14
24 18
25 32
26 24
27 29
28 25
29 25
30 50
31 44
32 30
33 41
34 37
35 8
36 9
37 17
38 26
39 43
40 29
41 31
42 60
43 48
44 20
45 23
46 43
47 66
48 61
49 29
50 40
51 69
52 57
53 20
54 23
55 43
56 66
57 52
58 60
59 53
60 53
61 106
62 97
63 77
64 46
65 58
66 104
67 95
68 63
69 89
70 82
71 29
72 39
73 68

List of values

[0, 1, 1, 2, 3, 5, 8, 6, 6, 12, 8, 9, 17, 13, 16, 14, 14, 28, 24, 14, 18, 32, 28, 14, 18, 32, 24, 29, 25, 25, 50, 44, 30, 41, 37, 8, 9, 17, 26, 43, 29, 31, 60, 48, 20, 23, 43, 66, 61, 29, 40, 69, 57, 20, 23, 43, 66, 52, 60, 53, 53, 106, 97, 77, 46, 58, 104, 95, 63, 89, 82, 29, 39, 68]