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.

A352881 a(n) is the minimal number z having the largest number of solutions to the Diophantine equation 1/z = 1/x + 1/y such that 1 <= x <= y <= 10^n.

Table of values

n a(n)
1 2
2 12
3 60
4 840
5 9240
6 55440
7 720720
8 6126120
9 116396280
10 232792560
11 5354228880
12 26771144400
13 465817912560
14 4813451763120
15 24067258815600
16 144403552893600
17 2671465728531600
18 36510031623265200
19 219060189739591200
20 4709794079401210800
21 18839176317604843200
22 221360321731856907600

List of values

[2, 12, 60, 840, 9240, 55440, 720720, 6126120, 116396280, 232792560, 5354228880, 26771144400, 465817912560, 4813451763120, 24067258815600, 144403552893600, 2671465728531600, 36510031623265200, 219060189739591200, 4709794079401210800, 18839176317604843200, 221360321731856907600]

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

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