cp's OEIS Frontend

m appears in this list if and only if it can be written as 2^p*3^r for p <= 10 or as 2^p*(2^q*3^r+1)*3^s for p+q <= 2.

m appears in this list if and only if m>1 and it can be written as 2^p*3^r for p in {0,3,6,9} or as 2(3^r+1)3^s (r>0) or (2*3^r+1)3^s.

m appears in this list if and only if it can be written as 2^p*3^r for p in {2,5,8} or as (3^r+1)3^s for r > 1.

m appears in this list if and only if it can be written as 2^p*3^r for p in {1,4,7,10} or as 4(3^r+1)3^s (r>0) or 2(2*3^r+1)3^s or (4*3^r+1)3^s.

A005245(n) is the integer complexity of n, which is the least number of copies of 1 needed to express n with addition and multiplication (and legal nestings of brackets). Although there are logarithmic upper and lower bounds for A005245(n), there are known instances such that it is not the case that A005245(n) <= A005245(m*n) for each of m = 2 and m = 3 (see the Examples below).

Is this integer sequence infinite? This is an open problem.