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.

A286854 Numbers k such that k == 1 or -1 (mod 6) but k does not divide the numerator of Bernoulli(2*k).

Table of values

n a(n)
1 55
2 253
3 275
4 385
5 605
6 715
7 935
8 1045
9 1081
10 1265
11 1375
12 1595
13 1705
14 1711
15 1771
16 1925
17 2035
18 2255
19 2365
20 2485
21 2585
22 2695
23 2783
24 2915
25 3025
26 3245
27 3289
28 3355
29 3403
30 3575
31 3685
32 3905
33 4015
34 4235
35 4301
36 4345
37 4565
38 4675
39 4807
40 4895
41 5005
42 5225
43 5335
44 5405
45 5555

List of values

[55, 253, 275, 385, 605, 715, 935, 1045, 1081, 1265, 1375, 1595, 1705, 1711, 1771, 1925, 2035, 2255, 2365, 2485, 2585, 2695, 2783, 2915, 3025, 3245, 3289, 3355, 3403, 3575, 3685, 3905, 4015, 4235, 4301, 4345, 4565, 4675, 4807, 4895, 5005, 5225, 5335, 5405, 5555]

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

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