Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Nov 17 2016 12:14:03
%S 1,3,4,6,9,12,13,18,19,27,28,36,39,40,42,54,57,58,60,63,81,84,85,87,
%T 90,94,108,117,120,121,126,127,130,135,141,162,171,174,175,180,181,
%U 189,190,195,202,211,243,252,255,256,261,262,270,271,282,283,285,292,303,316,324,351,360,363,364,378,381,382,384,390,391,393,405
%N Increasing sequence generated by these rules: a(1)=1, and if x is in a then floor(3x/2) and 3x are in a.
%C See A191203.
%H Ivan Neretin, <a href="/A191287/b191287.txt">Table of n, a(n) for n = 1..10000</a>
%e 1 -> 3 -> 4,9 -> 6,12,13,27 ->
%t g=15; Union[Flatten[NestList[{Floor[3#/2],3#} &, 1, g]]]
%t (* A191287; use g>14 to get all of first 60 terms *)
%Y Cf. A191203.
%K nonn
%O 1,2
%A _Clark Kimberling_, May 29 2011