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 May 17 2018 17:24:34
%S 1,2,4,5,7,8,11,13,14,17,20,22,23,26,31,34,35,40,41,44,47,52,53,61,62,
%T 67,68,71,79,80,92,94,95,101,103,104,107,119,121,122,125,134,139,142,
%U 143,152,155,157,158,161,179,182,184,185,188,202,203,206,209,214,215,229,233,236,238,239,242,269,274,277,278,283,284,287,304
%N Increasing sequence generated by these rules: a(1)=1, and if x is in a then [3x/2]+1 and 3x+2 are in a, where [ ]=floor.
%C See A191323.
%H Ivan Neretin, <a href="/A191324/b191324.txt">Table of n, a(n) for n = 1..10000</a>
%e 1 -> 2,5 -> 4,8,17 ->
%t h = 3; i = 1; j = 3; k = 2; f = 1; g = 12;
%t a = Union[Flatten[NestList[{Floor[h #/2] + i, j # + k} &, f, g]]] (* A191324 *)
%Y Cf. A191323.
%K nonn
%O 1,2
%A _Clark Kimberling_, May 30 2011