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.

Original entry on oeis.org

1, 2, 14, 644, 134043, 129963314, 626804494291
Offset: 0

Views

Author

Amarnath Murthy, Sep 03 2002

Keywords

Comments

a(7) <= 45164156742722455667280. - Giorgos Kalogeropoulos, Apr 10 2025

Crossrefs

Programs

  • Mathematica
    Do[k = 1; While[Length /@ FactorInteger /@ Range[k, k+n-1] != Table[n, {n}], k++ ]; Print[k], {n, 0, 5}] (* Ryan Propper, Oct 01 2005 *)

Extensions

Corrected and extended by Ryan Propper, Oct 01 2005
Offset corrected and a(6) from Donovan Johnson, Aug 03 2009