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.

A242193 Least prime p such that B_{2*n} == 0 (mod p) but there is no k < n with B_{2k} == 0 (mod p), or 1 if such a prime p does not exist, where B_m denotes the m-th Bernoulli number.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 5
6 691
7 7
8 3617
9 43867
10 283
11 11
12 103
13 13
14 9349
15 1721
16 37
17 17
18 26315271553053477373
19 19
20 137616929
21 1520097643918070802691
22 59
23 23
24 653
25 417202699
26 577
27 39409
28 113161
29 29
30 2003
31 31
32 1226592271
33 839
34 101
35 688531

List of values

[1, 1, 1, 1, 5, 691, 7, 3617, 43867, 283, 11, 103, 13, 9349, 1721, 37, 17, 26315271553053477373, 19, 137616929, 1520097643918070802691, 59, 23, 653, 417202699, 577, 39409, 113161, 29, 2003, 31, 1226592271, 839, 101, 688531]