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.

A110897 a(n) = 1 + a(n - a(n-1)) (n - a(n-1)) mod 2 + (n - a(n-2)) mod 3, with a(0) = 0, a(1) = 1.

Table of values

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

List of values

[0, 1, 3, 3, 2, 5, 2, 7, 1, 4, 3, 3, 4, 5, 5, 5, 5, 5, 6, 7, 7, 8, 6, 5, 7, 9, 6, 8, 9, 8, 7, 10, 8, 11, 7, 10, 9, 10, 12, 10, 9, 10, 9, 8, 12, 12, 9, 15, 11, 14, 10, 11, 10, 8, 12, 10, 12, 14, 14, 12, 13, 13, 15, 14, 12, 8, 15, 13, 12, 16, 14, 15, 15, 16, 17, 17, 14, 14, 14, 10, 15, 18, 14, 18]