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.

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

Table of values

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

List of values

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