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.

A302660 a(n) = (prime(n) mod 9) + (prime(n) mod 10).

Table of values

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

List of values

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