|
%I #71 Dec 23 2020 04:10:29
%S 1,2,3,4,5,6,7,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,25,26,28,
%T 29,30,31,33,34,35,36,37,38,39,41,42,43,44,45,46,47,48,49,50,51,52,53,
%U 55,57,58,59,60,61,62,63,65,66,67,68,69,70,71,73,74,75,76,77,78,79,80,81
%N Exponentially 2^n-numbers: 1 together with positive integers k such that all exponents in prime factorization of k are powers of 2.
%C Previous name: sequence consists of products of distinct relatively prime terms of A084400. - _Vladimir Shevelev_, Sep 24 2015
%C These numbers are also called "compact integers."
%C The density of this sequence exists and equals 0.872497...
%C There exist only seven compact factorials A000142(n) for n=1,2,3,6,7,10 and 11.
%C For a general definition of exponentially S-numbers, see comments in A209061. - _Vladimir Shevelev_, Sep 24 2015
%C The first 1000 digits of the density of the sequence were calculated by _Juan Arias-de-Reyna_ in A271727. - _Vladimir Shevelev_, Apr 18 2016
%C A225546 maps the set of terms 1:1 onto A268375. - _Peter Munn_, Jan 26 2020
%C Numbers whose sets of unitary divisors (A077610) and infinitary divisors (A077609) coincide. - _Amiram Eldar_, Dec 23 2020
%H Amiram Eldar, <a href="/A138302/b138302.txt">Table of n, a(n) for n = 1..10000</a>
%H S. Litsyn and V. Shevelev, <a href="http://www.emis.de/journals/INTEGERS/papers/h33/h33.Abstract.html">On Factorization of Integers with Restrictions on the Exponents</a>, INTEGERS: The Electronic Journal of Combinatorial Number Theory 7 (2007), #A33.
%H Vladimir Shevelev, <a href="http://dx.doi.org/10.4064/aa126-3-1">Compact integers and factorials</a>, Acta Arithmetica 126:3 (2007), pp. 195-236.
%H Vladimir Shevelev, <a href="http://arxiv.org/abs/1511.03860">Set of all densities of exponentially S-numbers</a>, arXiv preprint arXiv:1511.03860 [math.NT], 2015-2016.
%F Identities arising from the calculation of the density h of the sequence (cf. [Shevelev] and comment for a generalization in A209061):
%F h = Product_{prime p} Sum_{j in {0 and 2^k}}(p-1)/p^(j+1) = Product_{prime p} (1 + Sum_{j>=2} (u(j) - u(j-1))/p^j) = (1/zeta(2))* Product_{p}(1 + 1/(p+1))*Sum_{i>=1}p^(-(2^i-1)), where u(n) is the characteristic function of set {2^k, k>=0}. - _Vladimir Shevelev_, Sep 24 2015
%e 60 = 2^(2^1)*3^(2^0)*5^(2^0).
%p isA000079 := proc(n)
%p if n = 1 then
%p true;
%p else
%p type(n,'even') and nops(numtheory[factorset](n))=1 ;
%p simplify(%) ;
%p end if;
%p end proc:
%p isA138302 := proc(n)
%p local p;
%p if n = 1 then
%p return true;
%p end if;
%p for p in ifactors(n)[2] do
%p if not isA000079(op(2,p)) then
%p return false;
%p end if;
%p end do:
%p true ;
%p end proc:
%p for n from 1 to 100 do
%p if isA138302(n) then
%p printf("%d,",n) ;
%p end if;
%p end do: # _R. J. Mathar_, Sep 27 2016
%t lst={}; Do[p=Prime[n]; s=p^(1/3); f=Floor[s]; a=f^3; d=p-a; AppendTo[lst,d], {n,100}]; Union[lst] (* _Vladimir Joseph Stephan Orlovsky_, Mar 11 2009 *)
%t selQ[n_] := AllTrue[FactorInteger[n][[All, 2]], IntegerQ[Log[2, #]]&];
%t Select[Range[100], selQ] (* _Jean-François Alcover_, Oct 29 2018 *)
%o (PARI) is(n)=if(n<8, n>0, vecmin(apply(n->n>>valuation(n,2)==1, factor(n)[,2]))) \\ _Charles R Greathouse IV_, Dec 07 2012
%Y Cf. A000142, A005117, A050376, A084400, A209061, A271727.
%Y Related to A268375 via A225546.
%K nonn
%O 1,2
%A _Vladimir Shevelev_, May 07 2008
%E Incorrect comment removed by _Charles R Greathouse IV_, Dec 07 2012
%E Simpler name from _Vladimir Shevelev_, Sep 24 2015
%E Edited by _N. J. A. Sloane_, Nov 07 2015
|
