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.

A263317 Least prime p > n such that the numbers sigma(k^2)/k^2 (k = 1,...,n) are pairwise incongruent modulo p, where sigma(m) is the sum of the divisors of m.

Table of values

n a(n)
1 2
2 5
3 5
4 7
5 7
6 29
7 37
8 37
9 37
10 37
11 37
12 43
13 43
14 43
15 53
16 79
17 101
18 101
19 101
20 101
21 101
22 101
23 101
24 101
25 131
26 131
27 131
28 131
29 131
30 131
31 131
32 173
33 173
34 173
35 173
36 173
37 173
38 173
39 173
40 173
41 173
42 173
43 173
44 173
45 173
46 173
47 173
48 173
49 173
50 283
51 317
52 389
53 389
54 389
55 389
56 389
57 389
58 389
59 389
60 389

List of values

[2, 5, 5, 7, 7, 29, 37, 37, 37, 37, 37, 43, 43, 43, 53, 79, 101, 101, 101, 101, 101, 101, 101, 101, 131, 131, 131, 131, 131, 131, 131, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 283, 317, 389, 389, 389, 389, 389, 389, 389, 389, 389]

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

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