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.

A258195 Define a<+>b = odd part(odd part(a) + odd part(b)), where odd part(n) = A000265(n); a(n) is not already appeared prime of the form <+>_{1<=i<=k}i with the smallest k, or a(n)=0 if there is no such k (see comment).

Table of values

n a(n)
1 3
2 5
3 7
4 17
5 19
6 23
7 11
8 13
9 53
10 37
11 47
12 43
13 29
14 61
15 31
16 41
17 83
18 79
19 73
20 103
21 137
22 109
23 113
24 151
25 149
26 139
27 193
28 157
29 167
30 71
31 199
32 229
33 179
34 181
35 223
36 191
37 107
38 173
39 97
40 269
41 241
42 101
43 59
44 233
45 197
46 227
47 251
48 263
49 89
50 211
51 239
52 131
53 293
54 67
55 307
56 379
57 277

List of values

[3, 5, 7, 17, 19, 23, 11, 13, 53, 37, 47, 43, 29, 61, 31, 41, 83, 79, 73, 103, 137, 109, 113, 151, 149, 139, 193, 157, 167, 71, 199, 229, 179, 181, 223, 191, 107, 173, 97, 269, 241, 101, 59, 233, 197, 227, 251, 263, 89, 211, 239, 131, 293, 67, 307, 379, 277]