# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a079228
Showing 1-1 of 1

%I A079228 #14 Aug 21 2013 10:28:05
%S A079228 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,
%T A079228 29,28,29,30,31,33,33,34,35,37,37,38,39,41,41,42,43,46,46,46,47,51,49,
%U A079228 50,51,53,53,55,55,57,57,58,59,61,61,62,65,65,65,66,67,69,69,70,71,73,73
%N A079228 Least number > n with greater squarefree kernel than that of n.
%H A079228 Reinhard Zumkeller, <a href="/A079228/b079228.txt">Table of n, a(n) for n = 1..10000</a>
%t A079228 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 *)
%o A079228 (Haskell)
%o A079228 a079228 n = head [k | k <- [n+1..], a007947 k > a007947 n]
%o A079228 -- _Reinhard Zumkeller_, Oct 11 2011
%o A079228 (PARI) rad(n)=my(f=factor(n)[,1]);prod(i=1,#f,f[i])
%o A079228 a(n)=my(r=rad(n));while(rad(n++)<=r,); n \\ _Charles R Greathouse IV_, Aug 21 2013
%Y A079228 a(n) = n + A079229(n). Cf. A007947, A065642.
%K A079228 nonn,nice
%O A079228 1,1
%A A079228 _Reinhard Zumkeller_, Jan 02 2003

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE