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.

A190661 a(n) is the least number m such that there are at least n primes in the range (T(k-1), T(k)] for all k >= m, where T(k) is the k-th triangular number.

Table of values

n a(n)
0 1
1 7
2 16
3 33
4 52
5 66
6 79
7 72
8 109
9 93
10 121
11 119
12 130
13 153
14 169
15 194
16 180
17 222
18 235
19 275
20 294
21 267
22 256
23 296
24 329
25 339
26 333
27 420
28 383
29 373
30 372
31 454
32 396
33 443
34 449
35 504
36 463
37 574
38 559
39 512
40 592
41 602
42 596
43 541
44 652
45 585
46 683
47 656
48 687
49 689
50 708

List of values

[1, 7, 16, 33, 52, 66, 79, 72, 109, 93, 121, 119, 130, 153, 169, 194, 180, 222, 235, 275, 294, 267, 256, 296, 329, 339, 333, 420, 383, 373, 372, 454, 396, 443, 449, 504, 463, 574, 559, 512, 592, 602, 596, 541, 652, 585, 683, 656, 687, 689, 708]