This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A005117 Squarefree numbers: numbers that are not divisible by a square greater than 1. (Formerly M0617) 998
 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, 41, 42, 43, 46, 47, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 102, 103, 105, 106, 107, 109, 110, 111, 113 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 1 together with the numbers that are products of distinct primes. 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 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 Numbers n such that A007913(n) > phi(n). - Benoit Cloitre, Apr 10 2002 a(n) = smallest m with exactly n squarefree numbers <= m. - Amarnath Murthy, May 21 2002 n is squarefree <=> n divides prime(n)# where prime(n)# = product of first n prime numbers. - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 30 2004 Numbers n such that omega(n) = Omega(n) = A072047(n). - Lekraj Beedassy, Jul 11 2006 The LCM of any finite subset is in this sequence. - Lekraj Beedassy, Jul 11 2006 This sequence and the Beatty Pi^2/6 sequence (A059535) are "incestuous": the first 20000 terms are bounded within (-9, 14). - Ed Pegg Jr, Jul 22 2008 Let us introduce a function D(n) = sigma_0(n)/(2^(alpha(1) + ... + alpha(r)), sigma_0(n) number of divisors of n (A000005), prime factorization of n = p(1)^alpha(1) * ... * p(r)^alpha(r), alpha(1) + ... + alpha(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 0 A055229(m) for m < A062838(n). - Reinhard Zumkeller, Apr 09 2010 Numbers n such that gcd(n,n')=1 where n' is the arithmetic derivative (A003415) of n. - Giorgio Balzarotti, Apr 23 2011 Numbers n such that A007913(n) = core(n) = n. - Franz Vrabec, Aug 27 2011 Numbers n such that sqrt(n) cannot be simplified. - Sean Loughran, Sep 04 2011 Indices where A057918(n)=0, i.e., positive integers m for which there are no integers k in {1,2,...,m-1} such that k*m is square. - John W. Layman, Sep 08 2011 It appears that these are numbers n such that product(prime(k), k=1..n) mod n = 0 (see Maple code). - Gary Detlefs, Dec 07 2011. - This is the same claim as Mohammed Bouayoun's Mar 30 2004 comment above. To see why it holds: Primorial numbers, A002110, a subsequence of this sequence, are never divisible by any nonsquarefree number, A013929, and on the other hand, the index of the greatest prime dividing any n is less than n. Cf. A243291). - Antti Karttunen, Jun 03 2014 A008477(a(n)) = 1. - Reinhard Zumkeller, Feb 17 2012 A055653(a(n)) = a(n); A055654(a(n)) = 0. - Reinhard Zumkeller, Mar 11 2012 A008966(a(n)) = 1. - Reinhard Zumkeller, May 26 2012 Sum_{n>=1} 1/a(n)^s = zeta(s)/zeta(2*s). - Enrique Pérez Herrero, Jul 07 2012 A056170(a(n)) = 0. - Reinhard Zumkeller, Dec 29 2012 A013928(a(n)+1) = n. - Antti Karttunen, Jun 03 2014 Conjecture: For each n=2,3,... there are infinitely many integers b > a(n) such that Sum_{k=1..n} a(k)*b^(k-1) is prime, and the smallest such an integer b does not exceed (n+3)*(n+4). - Zhi-Wei Sun, Mar 26 2013 The probability that a random natural number belongs to the sequence is 6/Pi^2, A059956 (see Cesàro reference). - Giorgio Balzarotti, Nov 21 2013 Booker, Hiary, & Keating give a subexponential algorithm for testing membership in this sequence without factoring. - Charles R Greathouse IV, Jan 29 2014 Because in the factorizations into prime numbers these a(n) (n >= 2) have exponents which are either 0 or 1 one could call the a(n) 'numbers with a fermionic prime number decomposition'. The levels are the prime numbers prime(j), j >= 1, and the occupation numbers (exponents) e(j) are 0 or 1 (like in Pauli's exclusion principle). A 'fermionic state' is then denoted by a sequence with entries 0 or 1, where, except for the zero sequence, trailing zeros are omitted. The zero sequence stands for a(1) = 1. For example a(5) = 6 = 2^1*3^1 is denoted by the 'fermionic state' [1, 1], a(7) = 10 by [1, 0, 1]. Compare with 'fermionic partitions' counted in A000009. - Wolfdieter Lang, May 14 2014 Numbers whose sum of divisors is equal to the sum of unitary divisors: A000203(a(n)) = A034448(a(n)). - Paolo P. Lava, Oct 08 2014 From Vladimir Shevelev, Nov 20 2014: (Start) The following is an Eratosthenes-type sieve for squarefree numbers. For integers > 1: 1) Remove even numbers, except for 2; the minimal non-removed number is 3. 2) Replace multiples of 3 removed in step 1, and remove multiples of 3 except for 3 itself; the minimal non-removed number is 5. 3) Replace multiples of 5 removed as a result of steps 1 and 2, and remove multiples of 5 except for 5 itself; the minimal non-removed number is 6. 4) Replace multiples of 6 removed as a result of steps 1, 2 and 3 and remove multiples of 6 except for 6 itself; the minimal non-removed number is 7. 5) Repeat using the last minimal non-removed number to sieve from the recovered multiples of previous steps. Proof. We use induction. Suppose that as a result of the algorithm, we have found all squarefree numbers less than n and no other numbers. If n is squarefree, then the number of its proper divisors d>1 is even (it is 2^k - 2, where k is the number of its prime divisors), and, by the algorithm, it remains in the sequence. Otherwise, n is removed, since the number of its squarefree divisors >1 is odd (it is 2^k-1). (End) The lexicographically least sequence of integers > 1 such that each entry has an even number of proper divisors occurring in the sequence (that's the sieve restated). - Glen Whitney, Aug 30 2015 0 is nonsquarefree because it is divisible by any square. - Jon Perry, Nov 22 2014, edited by M. F. Hasler, Aug 13 2015 The Heinz numbers of partitions with distinct parts. We define the Heinz number of a partition p = [p_1, p_2, ..., p_r] as Product_{j=1..r} prime(j) (concept used by Alois P. Heinz in A215366 as an "encoding" of a partition). For example, for the partition [1, 1, 2, 4, 10] the Heinz number is 2*2*3*7*29 = 2436. The number 30 (= 2*3*5) is in the sequence because it is the Heinz number of the partition [1,2,3]. - Emeric Deutsch, May 21 2015 It is possible for 2 consecutive terms to be even; for example a(258)=422 and a(259)=426. - Thomas Ordowski, Jul 21 2015. - These form a subsequence of A077395 since their product is divisible by 4. - M. F. Hasler, Aug 13 2015 There are never more than 3 consecutive terms. Runs of 3 terms start at 1, 5, 13, 21, 29, 33, ... (A007675). - Ivan Neretin, Nov 07 2015 A046660(a(n)) = 0. - Reinhard Zumkeller, Nov 29 2015 a(n) = product of row n in A265668. - Reinhard Zumkeller, Dec 13 2015 Numbers without excess, i.e., A001221(a(n)) = A001222(a(n)). - Juri-Stepan Gerasimov, Sep 05 2016 Numbers n such that b^(phi(n)+1) == b (mod n) for every integer b. - Thomas Ordowski, Oct 09 2016 Boreico shows that the set of square roots of the terms of this sequence is linearly independent over the rationals. - Jason Kimberley, Nov 25 2016 (reference found by Michael Coons). Numbers n such that A008836(n) = A008683(n). - Enrique Pérez Herrero, Apr 04 2018 The Prime Zeta Function P(s) "has singular points along the real axis for s=1/k where k runs through all positive integers without a square factor". See Wolfram link. - Maleval Francis, Jun 23 2018 REFERENCES E. Cesàro, La serie di Lambert in aritmetica assintotica, Rend. Acc. Sc. Napoli, 1893 J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 165, p. 53, Ellipses, Paris 2008. I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers. 2nd ed., Wiley, NY, 1966, p. 251. M. Pohst and H. Zassenhaus, Algorithmic Algebraic Number Theory, Cambridge Univ. Press, page 432. N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS T. D. Noe and Daniel Forgues, Table of n, a(n) for n = 1..60794 (first 10000 terms from T. D. Noe) Andrew R. Booker, Ghaith A. Hiary, and Jon P. Keating, Detecting squarefree numbers, arXiv:1304.6937 [math.NT], 2013. I. Boreico, Linear independence of radicals, The Harvard College Mathematics Review 2(1), 87-92, Spring 2008. Henri Cohen, Francois Dress, and Mohamed El Marraki, Explicit estimates for summatory functions linked to the Möbius μ-function, Functiones et Approximatio Commentarii Mathematici 37 (2007), part 1, pp. 51-63. H. Gent, Letter to N. J. A. Sloane, Nov 27 1975. A. Granville, ABC means we can count squarefrees, International Mathematical Research Notices 19 (1998), 991-1009. P. Haukkanen, M. Mattila, J. K. Merikoski and T. Tossavainen, Can the Arithmetic Derivative be Defined on a Non-Unique Factorization Domain?, Journal of Integer Sequences, 16 (2013), #13.1.2. A. Krowne, PlanetMath.org, squarefree number L. Marmet, First occurrences of square-free gaps and an algorithm for their computation, arXiv preprint arXiv:1210.3829 [math.NT], 2012. S. Ramanujan, Irregular numbers, J. Indian Math. Soc. 5 (1913) 105-106. V. Shevelev, Set of all densities of exponentially S-numbers, arXiv preprint arXiv:1511.03860 [math.NT], 2015. Eric Weisstein's World of Mathematics, Squarefree Eric Weisstein's World of Mathematics, Prime Zeta Function Wikipedia, Squarefree integer FORMULA Lim_{n->infinity} a(n)/n = Pi^2/6 (see A013661). - Benoit Cloitre, May 23 2002 Equals A039956 UNION A056911. - R. J. Mathar, May 16 2008 Equals A000040 UNION A006881 UNION A007304 UNION A046386 UNION A046387 UNION A067885 ... - R. J. Mathar, Nov 05 2016 |a(n) - 6*n/Pi^2)| < 0.058377*sqrt(n) for n >= 268293; this result can be derived from Cohen, Dress, & El Marraki, see links. - Charles R Greathouse IV, Jan 18 2018 MAPLE with(numtheory); a := [ ]; for n from 1 to 200 do if issqrfree(n) then a := [ op(a), n ]; fi; od: t:= n-> product(ithprime(k), k=1..n): for n from 1 to 113 do if(t(n) mod n = 0) then print(n) fi od; # Gary Detlefs, Dec 07 2011 A005117 := proc(n) option remember; if n = 1 then 1; else for a from procname(n-1)+1 do if numtheory[issqrfree](a) then return a; end if; end do: end if; end proc:  # R. J. Mathar, Jan 09 2013 MATHEMATICA Select[ Range[ 113], SquareFreeQ] (* Robert G. Wilson v, Jan 31 2005 *) Select[Range, Max[Last /@ FactorInteger[ # ]] < 2 &] (* Joseph Biberstine (jrbibers(AT)indiana.edu), Dec 26 2006 *) NextSquareFree[n_, k_: 1] := Block[{c = 0, sgn = Sign[k]}, sf = n + sgn; While[c < Abs[k], While[ ! SquareFreeQ@ sf, If[sgn < 0, sf--, sf++]]; If[ sgn < 0, sf--, sf++]; c++]; sf + If[ sgn < 0, 1, -1]]; NestList[ NextSquareFree, 1, 70] (* Robert G. Wilson v, Apr 18 2014 *) PROG (MAGMA) [ n : n in [1..1000] | IsSquarefree(n) ]; (PARI) bnd = 1000; L = vector(bnd); j = 1; for (i=1, bnd, if(issquarefree(i), L[j]=i; j=j+1)); L (PARI) {a(n)= local(m, c); if(n<=1, n==1, c=1; m=1; while( c 1: A056911 (k = 2), A261034 (k = 3), A274546 (k = 4), A276378 (k = 5). Sequence in context: A240370 A193304 A076144 * A144338 A077377 A076786 Adjacent sequences:  A005114 A005115 A005116 * A005118 A005119 A005120 KEYWORD nonn,easy,nice,core AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 14 12:31 EDT 2019. Contains 328006 sequences. (Running on oeis4.)