Let S = smallest missing positive number, adjoin S, 3*S, 9*S, 27*S, 81*S, ... to the sequence until reaching a term that has S as a substring; reset S to the smallest missing positive number, repeat.

A331631

Let S = smallest missing positive number, adjoin S, 3*S, 9*S, 27*S, 81*S, ... to the sequence until reaching a term that has S as a substring; reset S to the smallest missing positive number, repeat.

Terms

    a(0) =1a(1) =3a(2) =9a(3) =27a(4) =81a(5) =2a(6) =6a(7) =18a(8) =54a(9) =162a(10) =4a(11) =12a(12) =36a(13) =108a(14) =324a(15) =5a(16) =15a(17) =7a(18) =21a(19) =63a(20) =189a(21) =567a(22) =8a(23) =24a(24) =72a(25) =216a(26) =648a(27) =10a(28) =30a(29) =90

External references