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.

A075044 a(0) = 1; a(n) = the smallest number k such that n numbers from k to k+n-1 have n distinct prime divisors, or 0 if no such number exists.

Table of values

n a(n)
0 1
1 2
2 14
3 644
4 134043
5 129963314
6 626804494291

List of values

[1, 2, 14, 644, 134043, 129963314, 626804494291]