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.

A210186 a(n) = least integer m>1 such that m divides none of P_i + P_j with 0 where P_k is the product of the first k primes.

Table of values

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

List of values

[2, 3, 5, 7, 11, 19, 23, 23, 23, 47, 59, 61, 71, 71, 71, 101, 101, 101, 101, 101, 101, 113, 113, 113, 113, 113, 113, 113, 113, 113, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 487, 487, 661, 661, 661, 661, 661, 661, 661, 661, 661, 719, 719, 719, 719, 719, 719, 811, 811, 811, 811, 811, 811, 811, 811, 811, 811]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.