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.

A246791 Smallest number m such that for 0 <= k < n, np(m+k) = np(m)+k, where np(t) is number of primes p with prime(t) < p < prime(t)^(1 + 1/t).

Table of values

n a(n)
1 1
2 4
3 15
4 136
5 2128
6 15453
7 479403
8 1184231
9 10975072
10 27112368
11 175600366
12 2304656281
13 14896902677
14 59331462112

List of values

[1, 4, 15, 136, 2128, 15453, 479403, 1184231, 10975072, 27112368, 175600366, 2304656281, 14896902677, 59331462112]