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.

A109322 a(n) is the minimum positive integer j such that [j, j+n-1] does not contain any values of sigma(k) (i.e., sum of all positive divisors of k).

Table of values

n a(n)
1 2
2 9
3 9
4 49
5 49
6 423
7 423
8 423
9 423
10 1333
11 1333
12 4425
13 4425
14 4425
15 4425
16 8763
17 8763
18 14089
19 14089
20 22825
21 22825
22 22825
23 22825
24 40291
25 40291
26 40291
27 40291
28 40291
29 40291
30 178705
31 178705
32 661285
33 661285
34 661285
35 661285
36 4543141
37 4543141
38 4543141
39 4543141
40 4543141
41 4543141
42 4543141
43 4543141
44 4543141
45 4543141
46 4543141
47 4543141

List of values

[2, 9, 9, 49, 49, 423, 423, 423, 423, 1333, 1333, 4425, 4425, 4425, 4425, 8763, 8763, 14089, 14089, 22825, 22825, 22825, 22825, 40291, 40291, 40291, 40291, 40291, 40291, 178705, 178705, 661285, 661285, 661285, 661285, 4543141, 4543141, 4543141, 4543141, 4543141, 4543141, 4543141, 4543141, 4543141, 4543141, 4543141, 4543141]