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.

A242223 Least prime p such that H(n) == 0 (mod p) but H(k) == 0 (mod p) for no 0 < k < n, or 1 if such a prime p does not exist, where H(n) denotes the n-th harmonic number sum_{k=1..n}1/k.

Table of values

n a(n)
1 1
2 3
3 11
4 5
5 137
6 7
7 1
8 761
9 7129
10 61
11 97
12 13
13 29
14 1049
15 41233
16 17
17 37
18 19
19 7440427
20 11167027
21 18858053
22 23
23 583859
24 577
25 109
26 34395742267
27 521
28 375035183
29 4990290163
30 31
31 2667653736673
32 2917
33 269
34 3583
35 397
36 1297
37 10839223
38 199
39 737281
40 41

List of values

[1, 3, 11, 5, 137, 7, 1, 761, 7129, 61, 97, 13, 29, 1049, 41233, 17, 37, 19, 7440427, 11167027, 18858053, 23, 583859, 577, 109, 34395742267, 521, 375035183, 4990290163, 31, 2667653736673, 2917, 269, 3583, 397, 1297, 10839223, 199, 737281, 41]