Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #10 Jul 10 2022 03:56:36
%S 1,2,3,6,8,24,27,32,54,96,128,216,243,384,486,512,864,1536,1944,2048,
%T 2187,3456,4374,6144,7776,8192,13824,17496,19683,24576,31104,32768,
%U 39366,55296,69984,98304,124416,131072,157464,177147,221184,279936,354294,393216,497664
%N Exponentially-odd 3-smooth numbers: number of the form 2^i * 3^j where i and j are either 0 or odd.
%H Amiram Eldar, <a href="/A355581/b355581.txt">Table of n, a(n) for n = 1..10000</a>
%F Sum_{n>=1} 1/a(n) = 55/24.
%e 6 is a term since 6 = 2^1 * 3^1 and the exponents of 2 and 3 are both odd: 1.
%e 24 is a term since 24 = 2^3 * 3^1 and the exponents of 2 and 3 are both odd: 3 and 1, respectively.
%t q[n_] := Module[{e = IntegerExponent[n, {2, 3}]}, (e[[1]] == 0 || OddQ[e[[1]]]) && (e[[2]] == 0 || OddQ[e[[2]]]) && Times@@({2, 3}^e) == n]; Select[Range[500000], q]
%o (PARI) is(n) = {my(e2 = valuation(n, 2), e3 = valuation(n, 3)); (e2 == 0 || e2%2) && (e3 == 0 || e3%2) && n == 2^e2 * 3^e3};
%o (Python)
%o from itertools import count, takewhile
%o def aupto(lim):
%o pows2 = list(takewhile(lambda x: x<lim, (2**i for i in count(1, 2))))
%o pows3 = list(takewhile(lambda x: x<lim, (3**i for i in count(1, 2))))
%o return sorted(c*d for c in [1]+pows2 for d in [1]+pows3 if c*d <= lim)
%o print(aupto(10**6)) # _Michael S. Branicky_, Jul 08 2022
%Y Intersection of A003586 and A268335.
%Y Subsequences: A002023, A013711, A092810.
%Y Cf. A355580.
%K nonn,easy
%O 1,2
%A _Amiram Eldar_, Jul 08 2022