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.

A317244 For n >= 3, smallest prime number N such that for every prime p >= N, every element in Z_p can be expressed as a sum of two n-gonal numbers mod p, without allowing zero as a summand.

Table of values

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

List of values

[11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 11, 11, 11, 11, 11, 11, 11, 23, 11, 11, 13, 29, 11, 11, 11, 11, 11, 11, 11, 37, 11, 13, 11, 11, 11, 11, 23, 11, 11, 11, 11, 47, 13, 11, 29, 53, 11, 11, 11, 11, 11, 11, 11, 13, 11, 23, 11, 61, 11, 11, 37, 11, 11, 11, 13, 71, 11, 29, 11, 73, 11, 11, 11, 11, 23, 13, 11, 83, 11, 11, 11, 89, 11, 11, 47, 11, 13, 11, 11, 11, 29, 37, 53, 23, 11]