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.

A075026 Define a number k to occupy a divisor cavity if d(k-1) > d(k) < d(k+1) where d(k) is the number of divisors of k. Sequence gives composite numbers occupying a divisor cavity.

Table of values

n a(n)
0 9
1 25
2 49
3 51
4 55
5 65
6 69
7 77
8 91
9 111
10 115
11 121
12 125
13 129
14 153
15 155
16 161
17 169
18 175
19 183
20 185
21 187
22 209
23 221
24 235
25 237
26 247
27 249
28 259
29 265
30 267
31 274
32 287
33 289
34 291
35 295
36 305
37 309
38 319
39 321
40 323
41 329
42 339
43 341
44 343
45 351
46 355
47 361
48 365
49 369
50 371
51 377
52 386
53 391

List of values

[9, 25, 49, 51, 55, 65, 69, 77, 91, 111, 115, 121, 125, 129, 153, 155, 161, 169, 175, 183, 185, 187, 209, 221, 235, 237, 247, 249, 259, 265, 267, 274, 287, 289, 291, 295, 305, 309, 319, 321, 323, 329, 339, 341, 343, 351, 355, 361, 365, 369, 371, 377, 386, 391]

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

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