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.

A265418 a(1)=2; for n>1, a(n) is the least prime q greater than p = a(n-1) such that p/q reaches a new minimum.

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 29
6 79
7 223
8 631
9 1787
10 5077
11 14431
12 41023
13 116639
14 331651
15 943031
16 2681467
17 7624649
18 21680413
19 61647497
20 175292519
21 498438203
22 1417291781
23 4030020143
24 11459222851
25 32583903763
26 92651203181
27 263450491193
28 749112358279
29 2130075077051
30 6056794796849
31 17222286484817

List of values

[2, 3, 5, 11, 29, 79, 223, 631, 1787, 5077, 14431, 41023, 116639, 331651, 943031, 2681467, 7624649, 21680413, 61647497, 175292519, 498438203, 1417291781, 4030020143, 11459222851, 32583903763, 92651203181, 263450491193, 749112358279, 2130075077051, 6056794796849, 17222286484817]

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

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