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.

A002072 a(n) = smallest number m such that for all k > m, either k or k+1 has a prime factor > prime(n).

Table of values

n a(n)
1 1
2 8
3 80
4 4374
5 9800
6 123200
7 336140
8 11859210
9 11859210
10 177182720
11 1611308699
12 3463199999
13 63927525375
14 421138799639
15 1109496723125
16 1453579866024
17 20628591204480
18 31887350832896
19 31887350832896
20 119089041053696
21 2286831727304144
22 9591468737351909375
23 9591468737351909375
24 9591468737351909375
25 9591468737351909375
26 9591468737351909375
27 19316158377073923834000

List of values

[1, 8, 80, 4374, 9800, 123200, 336140, 11859210, 11859210, 177182720, 1611308699, 3463199999, 63927525375, 421138799639, 1109496723125, 1453579866024, 20628591204480, 31887350832896, 31887350832896, 119089041053696, 2286831727304144, 9591468737351909375, 9591468737351909375, 9591468737351909375, 9591468737351909375, 9591468737351909375, 19316158377073923834000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.