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.

A075028 a(1) = 1, then a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in strictly ascending order.

Table of values

n a(n)
1 1
2 1
3 61
4 61
5 11371
6 11371
7 7392171
8 168776043
9 1584614377
10 38045133481
11 30386250649371
12 1848289766450821

List of values

[1, 1, 61, 61, 11371, 11371, 7392171, 168776043, 1584614377, 38045133481, 30386250649371, 1848289766450821]