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.

A356893 a(n) is the smallest number m such that m, m+1, m+2 and m+3 each have exactly n prime factors (counted with multiplicity).

Original entry on oeis.org

602, 4023, 57967, 8706123, 296299374, 4109290623, 1691788490622, 59004826709373
Offset: 3

Views

Author

Zak Seidov, Sep 03 2022

Keywords

Comments

a(9) <= 1691788490622, a(10) <= 198629571578750, a(11) <= 3650742165781248. - David A. Corneth, Sep 04 2022
a(11) > 2 * 10^15. - Toshitaka Suzuki, Aug 31 2025

Examples

			4023 = 3^3*149, 4024 = 2^3*503, 4025=5^2*7*23, 4026=2*3*11*61 (all products of four prime factors).
		

Crossrefs

Cf. A113752.

Extensions

a(9)-a(10) from Toshitaka Suzuki, Aug 31 2025