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.

A100383 Numbers k such that gpf(k) < gpf(k+1) < ... < gpf(k+9), where gpf(x) = A006530(x), the greatest prime factor of x. Numbers initiating an uphill gpf run of length 10.

Table of values

n a(n)
1 721970
2 1091150
3 6449639
4 6449640
5 10780550
6 12161824
7 15571630
8 17332430
9 23189750
10 24901256
11 28262037
12 30275508
13 30814114
14 32184457
15 32608598
16 35323087
17 35725704
18 38265227
19 38896955
20 69845438
21 71040720
22 74345936
23 79910528
24 85293163
25 111082114

List of values

[721970, 1091150, 6449639, 6449640, 10780550, 12161824, 15571630, 17332430, 23189750, 24901256, 28262037, 30275508, 30814114, 32184457, 32608598, 35323087, 35725704, 38265227, 38896955, 69845438, 71040720, 74345936, 79910528, 85293163, 111082114]