login
Squarefree numbers multiplied by binary powers.
33

%I #38 Sep 22 2020 02:42:16

%S 1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,19,20,21,22,23,24,26,28,29,

%T 30,31,32,33,34,35,37,38,39,40,41,42,43,44,46,47,48,51,52,53,55,56,57,

%U 58,59,60,61,62,64,65,66,67,68,69,70,71,73,74,76,77,78,79,80,82,83,84,85

%N Squarefree numbers multiplied by binary powers.

%C These numbers are called "oddly squarefree" in Banks and Luca. - _Michel Marcus_, Mar 14 2016

%C The asymptotic density of this sequence is 8/Pi^2 (A217739). - _Amiram Eldar_, Sep 21 2020

%H Reinhard Zumkeller, <a href="/A122132/b122132.txt">Table of n, a(n) for n = 1..10000</a>

%H William D. Banks and Florian Luca, <a href="http://dx.doi.org/10.4064/aa120-3-1">Roughly squarefree values of the Euler and Carmichael functions</a>, Acta Arithmetica, Vol. 120, No. 3 (2005), pp. 211-230.

%F a(n) = A007947(a(n)) * A006519(a(n)) / (2 - a(n) mod 2);

%F A007947(a(n)) = A000265(a(n)) * (2 - a(n) mod 2).

%F A008966(A000265(a(n))) = 1. - _Reinhard Zumkeller_, Jan 24 2012

%F A010052(A008477(a(n))) = 1. - _Reinhard Zumkeller_, Feb 17 2012

%t Select[Range@ 85, SquareFreeQ[#/2^IntegerExponent[#, 2]] &] (* _Michael De Vlieger_, Mar 15 2020 *)

%o (Haskell)

%o a122132 n = a122132_list !! (n-1)

%o a122132_list = filter ((== 1) . a008966 . a000265) [1..]

%o -- _Reinhard Zumkeller_, Jan 24 2012

%o (PARI) is(n)=issquarefree(n>>valuation(n,2)); \\ _Charles R Greathouse IV_, Sep 02 2015

%Y Subsequences: A000079, A005117, A007283, A051916, A056911, A029747.

%Y Complement: A038838.

%Y Cf. A217739.

%K nonn,easy

%O 1,2

%A _Reinhard Zumkeller_, Aug 21 2006