OFFSET
1,1
COMMENTS
The analog of A298607 for 3^k instead of 2^k.
The complement A238939 is conjectured to have only 23 elements, the largest being 3^68. Thus, all larger powers of 3 are (conjectured to be) in this sequence. Each of the subsequences "powers of 3 with exactly n digits 0" is conjectured to be finite. Provided there is at least one such element for each n >= 0, this leads to a partition of the integers, given in A305933.
MATHEMATICA
Select[3^Range[0, 40], DigitCount[#, 10, 0]>0&] (* Harvey P. Dale, May 30 2020 *)
PROG
(PARI) for(k=0, 69, vecmin(digits(3^k))|| print1(3^k", "))
(PARI) select( t->!vecmin(digits(t)), apply( k->3^k, [0..40]))
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
M. F. Hasler, Jun 15 2018
STATUS
approved