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.

A079892 Least number > n having one more distinct prime factor than n.

Original entry on oeis.org

2, 6, 6, 6, 6, 30, 10, 10, 10, 30, 12, 30, 14, 30, 30, 18, 18, 30, 20, 30, 30, 30, 24, 30, 26, 30, 28, 30, 33, 210, 33, 33, 42, 42, 42, 42, 38, 42, 42, 42, 44, 210, 44, 60, 60, 60, 48, 60, 50, 60, 60, 60, 54, 60, 60, 60, 60, 60, 62, 210, 62, 66, 66, 65, 66, 210, 68, 70, 70, 210
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 14 2003

Keywords

Comments

A001221(a(n)) = A001221(n) + 1;
a(A002110(k)) = A002110(k+1).

Crossrefs

Programs

  • Haskell
    a079892 n = head [x | x <- [n + 1 ..], a001221 x == 1 + a001221 n]
    -- Reinhard Zumkeller, Aug 29 2013