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.
%I A079229 #14 Aug 02 2013 10:48:53
%S A079229 1,1,2,1,1,1,3,1,1,1,2,1,1,1,2,1,2,1,2,1,1,1,3,2,1,3,1,1,1,1,2,1,1,1,
%T A079229 2,1,1,1,2,1,1,1,3,2,1,1,4,1,1,1,2,1,2,1,2,1,1,1,2,1,1,3,2,1,1,1,2,1,
%U A079229 1,1,2,1,1,3,1,1,1,1,3,2,1,1,2,1,1,1,2,1,2,1,2,1,1,1,2,1,4,1,2,1,1,1,2,1,1
%N A079229 Least k>0 such that rad(n+k) > rad(n), where rad is the squarefree kernel (A007947).
%C A079229 A020754 probably gives the records in this sequence. - _Charles R Greathouse IV_, Aug 02 2013
%H A079229 Reinhard Zumkeller, <a href="/A079229/b079229.txt">Table of n, a(n) for n = 1..10000</a>
%t A079229 rad[n_] := Times @@ FactorInteger[n][[All, 1]]; a[1] = 1; a[n_] := For[k = 1, True, k++, If[ rad[n+k] > rad[n], Return[k]]]; Table[ a[n], {n, 1, 105}] (* _Jean-François Alcover_, Oct 05 2012 *)
%o A079229 (Haskell)
%o A079229 a079229 n = a079229_list !! (n-1)
%o A079229 a079229_list = f a007947_list where
%o A079229 f (x:xs) = ((+ 1) . length $ takeWhile (<= x) xs) : f xs
%o A079229 -- _Reinhard Zumkeller_, Oct 06 2012
%o A079229 (PARI) rad(n)=my(f=factor(n)[,1]);prod(i=1,#f,f[i])
%o A079229 a(n)=my(r=rad(n),k);while(r>=rad(n+k++),);k \\ _Charles R Greathouse IV_, Aug 02 2013
%Y A079229 a(n) = A079228(n) - n.
%K A079229 nonn
%O A079229 1,3
%A A079229 _Reinhard Zumkeller_, Jan 02 2003