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.

A373401 Least k such that the k-th maximal antirun of prime numbers > 3 has length n. Position of first appearance of n in A027833. The sequence ends if no such antirun exists.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 10
6 8
7 69
8 40
9 24
10 46
11 41
12 21
13 140
14 82
15 131
16 210
17 50
18 199
19 35
20 30
21 248
22 192
23 277
24 185
25 458
26 1053
27 251
28 325
29 271
30 645
31 748
32 815
33 811
34 1629
35 987
36 826
37 1967
38 423
39 1456
40 2946
41 1109
42 406
43 1870
44 1590
45 3681
46 2920
47 3564
48 6423
49 1426
50 5953
51 8345
52 12687
53 6846

List of values

[1, 2, 4, 6, 10, 8, 69, 40, 24, 46, 41, 21, 140, 82, 131, 210, 50, 199, 35, 30, 248, 192, 277, 185, 458, 1053, 251, 325, 271, 645, 748, 815, 811, 1629, 987, 826, 1967, 423, 1456, 2946, 1109, 406, 1870, 1590, 3681, 2920, 3564, 6423, 1426, 5953, 8345, 12687, 6846]