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.

A175143 a(1)=1. a(n) = the smallest integer > a(n-1) such that d(a(n))+d(a(n)+1) > d(a(n-1))+d(a(n-1)+1), where d(m) = the number of divisors of m.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 8
6 11
7 15
8 20
9 24
10 35
11 59
12 80
13 84
14 119
15 224
16 239
17 335
18 359
19 360
20 480
21 539
22 719
23 720
24 840
25 1079
26 1259
27 1260
28 1679
29 2519
30 4199
31 5039
32 5040
33 6720
34 7559
35 9360
36 10079
37 10080
38 15119
39 20159
40 25199
41 25200
42 27719
43 32759
44 43680
45 50399
46 55439
47 75599

List of values

[1, 2, 3, 5, 8, 11, 15, 20, 24, 35, 59, 80, 84, 119, 224, 239, 335, 359, 360, 480, 539, 719, 720, 840, 1079, 1259, 1260, 1679, 2519, 4199, 5039, 5040, 6720, 7559, 9360, 10079, 10080, 15119, 20159, 25199, 25200, 27719, 32759, 43680, 50399, 55439, 75599]