cp's OEIS Frontend

A067535 Smallest squarefree number >= n.

%I A067535 #22 Feb 16 2025 08:32:45
%S A067535 1,2,3,5,5,6,7,10,10,10,11,13,13,14,15,17,17,19,19,21,21,22,23,26,26,
%T A067535 26,29,29,29,30,31,33,33,34,35,37,37,38,39,41,41,42,43,46,46,46,47,51,
%U A067535 51,51,51,53,53,55,55,57,57,58,59,61,61,62
%N A067535 Smallest squarefree number >= n.
%H A067535 Michael De Vlieger, <a href="/A067535/b067535.txt">Table of n, a(n) for n = 1..10000</a>
%H A067535 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Squarefree.html">Squarefree</a>.
%F A067535 a(n) = n + A081221(n). - _Amiram Eldar_, Oct 10 2023
%p A067535 A067535 := proc(n)
%p A067535     for a from n do
%p A067535         if issqrfree(a) then
%p A067535             return a ;
%p A067535         end if;
%p A067535     end do:
%p A067535 end proc:
%p A067535 seq(A067535(n),n=1..100) ; # _R. J. Mathar_, May 31 2024
%t A067535 Table[k = n; While[! SquareFreeQ@ k, k++]; k, {n, 62}] (* _Michael De Vlieger_, Mar 18 2017 *)
%o A067535 (PARI) a(n) = while (! issquarefree(n), n++); n; \\ _Michel Marcus_, Mar 18 2017
%o A067535 (Python)
%o A067535 from itertools import count
%o A067535 from sympy import factorint
%o A067535 def A067535(n): return next(m for m in count(n) if max(factorint(m).values(),default=0)<=1) # _Chai Wah Wu_, Dec 04 2024
%Y A067535 Cf. A005117, A070321, A076260, A081221.
%K A067535 nonn
%O A067535 1,2
%A A067535 _Reinhard Zumkeller_, Jan 27 2002