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.

A353284 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 prime power, then p is in the sequence.

Table of values

n a(n)
1 3
2 5
3 7
4 13
5 23
6 29
7 31
8 37
9 41
10 53
11 61
12 67
13 73
14 97
15 101
16 103
17 113
18 127
19 137
20 163
21 167
22 181
23 193
24 199
25 211
26 229
27 241
28 263
29 269
30 277
31 281
32 311
33 317
34 353
35 373
36 383
37 401
38 421
39 433
40 439
41 461
42 509
43 541
44 547
45 569
46 593
47 601
48 613
49 617
50 631
51 641
52 677
53 701
54 709
55 727
56 743
57 757
58 769
59 821
60 839
61 857
62 887

List of values

[3, 5, 7, 13, 23, 29, 31, 37, 41, 53, 61, 67, 73, 97, 101, 103, 113, 127, 137, 163, 167, 181, 193, 199, 211, 229, 241, 263, 269, 277, 281, 311, 317, 353, 373, 383, 401, 421, 433, 439, 461, 509, 541, 547, 569, 593, 601, 613, 617, 631, 641, 677, 701, 709, 727, 743, 757, 769, 821, 839, 857, 887]