%I #28 Oct 27 2023 13:12:19
%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,82,83,84
%N Exponentially odious numbers: 1 together with positive integers n such that all exponents in prime factorization of n are odious numbers (A000069).
%C A268385 maps each term of this sequence to a unique term of A268335, and vice versa.
%C The asymptotic density of this sequence is Product_{p prime} f(1/p) = 0.87686263163054480657..., where f(x) = 1 - x + (1 - (1-x) * Product_{k>=0} (1-x^(2^k)))/2. - _Amiram Eldar_, Oct 27 2023
%H Antti Karttunen, <a href="/A270428/b270428.txt">Table of n, a(n) for n = 1..10000</a>
%H Vladimir Shevelev, <a href="http://dx.doi.org/10.4064/aa8395-5-2016">S-exponential numbers</a>, Acta Arithmetica, Vol. 175 (2016), 385-395.
%t odiousQ[n_] := OddQ[DigitCount[n, 2, 1]]; Select[Range[100], AllTrue[FactorInteger[#][[;;, 2]], odiousQ] &] (* _Amiram Eldar_, May 18 2023 *)
%o (PARI)
%o A355825(n) = factorback(apply(e->(hammingweight(e)%2), factor(n)[, 2]));
%o isA270428(n) = A355825(n); \\ _Antti Karttunen_, Jul 21 2022
%o (Scheme, two variants, both requiring _Antti Karttunen_'s IntSeq-library)
%o (define A270428 (ZERO-POS 1 1 (COMPOSE sub1 A270419)))
%o (definec (chA270428 n) (cond ((= 1 n) 1) (else (* (A010060 (A067029 n)) (chA270428 (A028234 n))))))
%o (define A270428 (NONZERO-POS 1 1 chA270428))
%Y Apart from 1, a subsequence of A270420.
%Y Indices of ones in A270419.
%Y Sequence A270436 sorted into ascending order.
%Y Cf. A010060, A028234, A067029, A355825 (characteristic function).
%Y Cf. also A262675, A268335, A268385.
%Y Differs from its subsequence A138302 for the first time at n=113, where a(113) = 128 = 2^7, a value which does not occur in A138302.
%K nonn,easy
%O 1,2
%A _Antti Karttunen_, May 26 2016