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.

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

Table of values

n a(n)
1 1
2 3
3 15
4 909
5 306915
6 36181647
7 25342642989

List of values

[1, 3, 15, 909, 306915, 36181647, 25342642989]