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.

A293542 a(1)=1; for n>1, a(n) = least integer greater than a(n-1) such that the sums of the divisors of the pairwise sums of a(1),...,a(n) are all distinct.

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 19
6 28
7 56
8 72
9 101
10 144
11 202
12 240
13 261
14 448
15 511
16 602
17 772
18 806
19 1152
20 1296
21 1541
22 1602
23 2016
24 2256
25 2900
26 3322
27 3362
28 3978
29 4376
30 5887
31 6416
32 7702
33 8228
34 8578
35 11341
36 11382
37 13376
38 13692
39 16083
40 16380
41 16544
42 17382
43 22726
44 24944
45 26302
46 27508
47 30580
48 33184
49 34020
50 37474

List of values

[1, 2, 4, 8, 19, 28, 56, 72, 101, 144, 202, 240, 261, 448, 511, 602, 772, 806, 1152, 1296, 1541, 1602, 2016, 2256, 2900, 3322, 3362, 3978, 4376, 5887, 6416, 7702, 8228, 8578, 11341, 11382, 13376, 13692, 16083, 16380, 16544, 17382, 22726, 24944, 26302, 27508, 30580, 33184, 34020, 37474]