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.

A242241 Least prime p such that H(2,n) = sum_{k=1..n}1/k^2 == 0 (mod p) but there is no 0 < k < n with H(2,k) == 0 (mod p), or 1 if such a prime p does not exist.

Table of values

n a(n)
1 1
2 5
3 7
4 41
5 11
6 13
7 266681
8 17
9 19
10 178939
11 23
12 18500393
13 40799043101
14 29
15 31
16 619
17 601
18 8821
19 86364397717734821
20 421950627598601
21 2621
22 295831
23 47
24 2237
25 157
26 53
27 307
28 7741
29 6823
30 61
31 205883
32 487
33 67
34 21767149
35 71
36 73
37 149
38 2004383
39 79
40 34033

List of values

[1, 5, 7, 41, 11, 13, 266681, 17, 19, 178939, 23, 18500393, 40799043101, 29, 31, 619, 601, 8821, 86364397717734821, 421950627598601, 2621, 295831, 47, 2237, 157, 53, 307, 7741, 6823, 61, 205883, 487, 67, 21767149, 71, 73, 149, 2004383, 79, 34033]