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.

A246783 Smallest number m such that all the n numbers np(m+k-1), 0 < k < n+1 are equal, 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 1
3 1
4 1
5 67
6 67
7 67
8 67
9 67
10 54412
11 161342
12 161342
13 1214143
14 9915018
15 9915018
16 68964006
17 68964006
18 810832784
19 19867608968
20 52415066804
21 119937255921
22 272007811177

List of values

[1, 1, 1, 1, 67, 67, 67, 67, 67, 54412, 161342, 161342, 1214143, 9915018, 9915018, 68964006, 68964006, 810832784, 19867608968, 52415066804, 119937255921, 272007811177]