Search: id:A005117 Results 1-1 of 1 results found. %I A005117 M0617 %S A005117 1,2,3,5,6,7,10,11,13,14,15,17,19,21,22,23,26,29,30,31,33,34,35,37,38, 39, %T A005117 41,42,43,46,47,51,53,55,57,58,59,61,62,65,66,67,69,70,71,73,74,77,78, 79, %U A005117 82,83,85,86,87,89,91,93,94,95,97,101,102,103,105,106,107,109,110,111, 113 %N A005117 Square-free numbers: numbers that are not divisible by a square greater than 1. %C A005117 1 together with the numbers that are products of distinct primes. %C A005117 Also smallest sequence with the property that a(m)*a(n) is never a square for n <> m. - Ulrich Schimke (ulrschimke(AT)aol.com), Dec 12 2001 %C A005117 Numbers n such that there is only one Abelian group with n elements, the cyclic group of order n (the numbers such that A000688(n) = 1). - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001 %C A005117 Numbers n such that A007913(n)>phi(n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 10 2002 %C A005117 a(n) = smallest m with exactly n square-free numbers <= m. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 21 2002 %C A005117 n is squarefree <=> n divides n# where n# = product of first n prime numbers - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 30 2004 %C A005117 Numbers n such that omega(n)=Omega(n)=A072047(n). - Lekraj Beedassy (blekraj(AT)yahoo.com), Jul 11 2006 %C A005117 The lcm of any subsequence of a(n) is in a(n). - Lekraj Beedassy (blekraj(AT)yahoo.com), Jul 11 2006 %C A005117 Comment from Ed Pegg Jr (ed(AT)mathpuzzle.com), Jul 22 2008: This sequence and the Beatty Pi^2/6 sequence (A059535) are "incestuous": the first 20000 terms are bounded within (-9, 14). %C A005117 Let us introduce a function D(n)=sigma_0(n)/(2^(alfa(1)+...+alfa(r)), sigma_0(n) number of divisors of n (A000005), prime factorization of n=p(1)^alfa(1) * ... * p(r)^alfa(r), alfa(1)+...+alfa(r) is sequence (A086436). Function D(n) splits the set of positive integers into subsets, according to the value of D(n). Squarefree numbers (A005117) has D(n)=1, other numbers are "deviated" from the squarefree ideal and have 0Table of n, a(n) for n=1..60794 %H A005117 A. Granville, ABC means we can count squarefrees, International Mathematical Research Notices 19 (1998), 991-1009. %H A005117 A. Krowne, PlanetMath.org, square-free number %H A005117 L. Marmet, First occurrences of square-free gaps... %H A005117 S. Ramanujan, Irregular numbers, J. Indian Math. Soc. 5 (1913) 105-106. %H A005117 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. %H A005117 Wikipedia, Square-free %F A005117 Lim n -> infinity a(n)/n=Pi^2/6 - Benoit Cloitre (benoit7848c(AT)orange.fr), May 23 2002 %F A005117 A039956 UNION A056911. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 16 2008 %p A005117 with(numtheory); a := [ ]; for n from 1 to 200 do if issqrfree(n) then a := [ op(a), n ]; fi; od: %t A005117 (* first do *) Needs["NumberTheory`NumberTheoryFunctions`"] (* then *) Select[ Range[ 113], SquareFreeQ[ # ] &] (from Robert G. Wilson v Jan 31 2005) %t A005117 Select[Range[150], Max[Last /@ FactorInteger[ # ]] < 2 &] - Joseph Biberstine (jrbibers(AT)indiana.edu), Dec 26 2006 %t A005117 max = 0; a = {}; Do[m = FactorInteger[n]; w = Product[m[[k]][[1]], {k, 1, Length[m]}]; If[w > max, AppendTo[a, n]; max = w], {n, 1, 1000}]; a - Artur Jasinski (grafix(AT)csl.pl), Apr 06 2008 %o A005117 (MAGMA) [ n : n in [1..1000] | IsSquarefree(n) ]; %o A005117 (PARI) bnd = 1000; L = vector(bnd); j = 1; for (i=1,bnd, if(issquarefree(i), L[j]=i:j=j+1)); L %o A005117 (PARI) {a(n)= local(m,c); if(n<=1,n==1, c=1; m=1; while( c