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.

A135058 Least m such that both m and m+n have exactly n distinct prime divisors, ignoring multiplicity.

Table of values

n a(n)
0 1
1 2
2 10
3 102
4 1326
5 96135
6 607614
7 159282123
8 9617162170
9 1110180535035
10 28334309296920
11 16513791577659519
12 271518698440871310

List of values

[1, 2, 10, 102, 1326, 96135, 607614, 159282123, 9617162170, 1110180535035, 28334309296920, 16513791577659519, 271518698440871310]