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.

A353286 Consider the number of divisors tau(k) of every composite k between prime p >= 3 and the next prime; if the largest tau(k) is a cube, then p is in the sequence.

Table of values

n a(n)
1 23
2 29
3 37
4 41
5 53
6 61
7 67
8 73
9 101
10 103
11 127
12 137
13 163
14 181
15 229
16 241
17 281
18 353
19 421
20 433
21 601
22 617
23 641
24 821
25 887
26 1093
27 1433
28 1489
29 1697
30 1759
31 1877
32 2081
33 2083
34 2237
35 2297
36 2381
37 2657
38 2801
39 2953
40 3461
41 3529
42 3557
43 3917
44 4153
45 4349
46 4637
47 4721
48 4789
49 5441
50 5689

List of values

[23, 29, 37, 41, 53, 61, 67, 73, 101, 103, 127, 137, 163, 181, 229, 241, 281, 353, 421, 433, 601, 617, 641, 821, 887, 1093, 1433, 1489, 1697, 1759, 1877, 2081, 2083, 2237, 2297, 2381, 2657, 2801, 2953, 3461, 3529, 3557, 3917, 4153, 4349, 4637, 4721, 4789, 5441, 5689]