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.

A105052 Write a(n) as a four-bit number; those bits state whether 10n+1, 10n+3, 10n+7 and 10n+9 are primes.

Table of values

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

List of values

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