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.

Showing 1-1 of 1 results.

A082048 a(n) = least number greater than n having greater smallest prime factor than that of n.

Original entry on oeis.org

2, 3, 5, 5, 7, 7, 11, 9, 11, 11, 13, 13, 17, 15, 17, 17, 19, 19, 23, 21, 23, 23, 29, 25, 29, 27, 29, 29, 31, 31, 37, 33, 35, 35, 37, 37, 41, 39, 41, 41, 43, 43, 47, 45, 47, 47, 53, 49, 53, 51, 53, 53, 59, 55, 59, 57, 59, 59, 61, 61, 67, 63, 65, 65, 67, 67, 71, 69, 71, 71, 73, 73
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 02 2003

Keywords

Crossrefs

Programs

  • Mathematica
    gsp[n_]:=Module[{k=n+1,f=FactorInteger[n][[1,1]]},While[ FactorInteger[ k] [[1,1]]<=f,k++];k]; Array[gsp,80] (* Harvey P. Dale, Sep 05 2015 *)

Formula

A020639(a(n)) > A020639(n) and A020639(i) <= A020639(n) for n < i < a(n);
for m > 1: a(m) = m+1 iff m even;
p prime: a(p) = next prime: a(A000040(n)) = A000040(A049084(n)+1).
Showing 1-1 of 1 results.