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.

A088123 Let f(n,x) = 1 + 2x + 3x^2 + 5x^3 + 7x^4 + ... + prime(n)*x^n; a(n) = smallest value of x such that f(n,x) is a prime, or 0 if no such prime exists.

Table of values

n a(n)
1 1
2 2
3 1
4 6
5 1
6 6
7 1
8 8
9 1
10 74
11 6
12 6
13 1
14 2
15 11
16 102
17 20
18 88
19 1
20 52
21 10
22 18
23 2
24 56
25 1
26 26
27 37
28 216
29 1
30 78
31 1
32 28
33 21
34 160
35 3
36 276
37 30
38 1542
39 42
40 598
41 20
42 20
43 333
44 186
45 8
46 82
47 11
48 90
49 1
50 246
51 1
52 240
53 83
54 58
55 9
56 76
57 1
58 16
59 21
60 700
61 60
62 10
63 87
64 250
65 62
66 406
67 2
68 502
69 140
70 186
71 1293
72 578

List of values

[1, 2, 1, 6, 1, 6, 1, 8, 1, 74, 6, 6, 1, 2, 11, 102, 20, 88, 1, 52, 10, 18, 2, 56, 1, 26, 37, 216, 1, 78, 1, 28, 21, 160, 3, 276, 30, 1542, 42, 598, 20, 20, 333, 186, 8, 82, 11, 90, 1, 246, 1, 240, 83, 58, 9, 76, 1, 16, 21, 700, 60, 10, 87, 250, 62, 406, 2, 502, 140, 186, 1293, 578]