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.

A353285 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 square, then p is in the sequence.

Table of values

n a(n)
1 5
2 7
3 31
4 97
5 113
6 167
7 193
8 199
9 211
10 263
11 269
12 277
13 311
14 317
15 373
16 383
17 401
18 439
19 461
20 509
21 541
22 547
23 569
24 593
25 613
26 631
27 677
28 701
29 709
30 727
31 743
32 757
33 769
34 857
35 907
36 941
37 947
38 1021
39 1031
40 1063
41 1123
42 1153
43 1217
44 1229
45 1249
46 1259
47 1283
48 1289
49 1291
50 1301
51 1321
52 1361

List of values

[5, 7, 31, 97, 113, 167, 193, 199, 211, 263, 269, 277, 311, 317, 373, 383, 401, 439, 461, 509, 541, 547, 569, 593, 613, 631, 677, 701, 709, 727, 743, 757, 769, 857, 907, 941, 947, 1021, 1031, 1063, 1123, 1153, 1217, 1229, 1249, 1259, 1283, 1289, 1291, 1301, 1321, 1361]