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.

A079228 Least number > n with greater squarefree kernel than that of n.

Original entry on oeis.org

2, 3, 5, 5, 6, 7, 10, 9, 10, 11, 13, 13, 14, 15, 17, 17, 19, 19, 21, 21, 22, 23, 26, 26, 26, 29, 28, 29, 30, 31, 33, 33, 34, 35, 37, 37, 38, 39, 41, 41, 42, 43, 46, 46, 46, 47, 51, 49, 50, 51, 53, 53, 55, 55, 57, 57, 58, 59, 61, 61, 62, 65, 65, 65, 66, 67, 69, 69, 70, 71, 73, 73
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 02 2003

Keywords

Crossrefs

a(n) = n + A079229(n). Cf. A007947, A065642.

Programs

  • Haskell
    a079228 n = head [k | k <- [n+1..], a007947 k > a007947 n]
    -- Reinhard Zumkeller, Oct 11 2011
    
  • Mathematica
    rad[n_] := Times @@ FactorInteger[n][[All, 1]]; a[1] = 2; a[n_] := For[k = 1, True, k++, If[rad[n + k] > rad[n], Return[n + k]]]; Table[a[n], {n, 1, 72}] (* Jean-François Alcover, Oct 05 2012 *)
  • PARI
    rad(n)=my(f=factor(n)[,1]);prod(i=1,#f,f[i])
    a(n)=my(r=rad(n));while(rad(n++)<=r,); n \\ Charles R Greathouse IV, Aug 21 2013