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.

A097978 a(n) = least m such that m and m+n are both products of exactly n distinct primes.

Table of values

n a(n)
0 1
1 2
2 33
3 102
4 1326
5 115005
6 31295895
7 159282123
8 9617162170
9 1535531452026
10 1960347077019695
11 16513791577659519
12 271518698440871310

List of values

[1, 2, 33, 102, 1326, 115005, 31295895, 159282123, 9617162170, 1535531452026, 1960347077019695, 16513791577659519, 271518698440871310]