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.

A329525 a(n) is the smallest positive number k such that k and k+n are both abundant.

Table of values

n a(n)
1 5775
2 18
3 942
4 20
5 940
6 12
7 945
8 12
9 936
10 20
11 4725
12 12
13 4712
14 40
15 930
16 20
17 928
18 12
19 2816
20 20
21 924
22 18
23 945
24 12
25 920
26 30
27 918
28 12
29 2176
30 12
31 3465
32 24
33 912
34 20
35 910
36 12
37 7208
38 18
39 906
40 20
41 4095
42 12
43 5312
44 12
45 900
46 20
47 945
48 12
49 896
50 20
51 894
52 18
53 4672
54 12
55 945
56 24

List of values

[5775, 18, 942, 20, 940, 12, 945, 12, 936, 20, 4725, 12, 4712, 40, 930, 20, 928, 12, 2816, 20, 924, 18, 945, 12, 920, 30, 918, 12, 2176, 12, 3465, 24, 912, 20, 910, 12, 7208, 18, 906, 20, 4095, 12, 5312, 12, 900, 20, 945, 12, 896, 20, 894, 18, 4672, 12, 945, 24]