Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #10 Jul 13 2013 12:04:10
%S 1,2,4,5,8,11,14,16,20,23,32,41,44,47,56,59,64,68,80,92,95,122,128,
%T 131,140,164,167,176,188,191,203,224,236,239,256,272,275,284,320,365,
%U 368,380,383,392,419,488,491,500,512,524,527,560,563,572,608,656,668,671,704,707,716,752,764,767,812,815,824,851,896,944,956,959
%N Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-1 and 4x are in a.
%C See A191113.
%H Reinhard Zumkeller, <a href="/A191122/b191122.txt">Table of n, a(n) for n = 1..10000</a>
%t h = 3; i = -1; j = 4; k = 0; f = 1; g = 9;
%t a = Union[Flatten[NestList[{h # + i, j # + k} &, f, g]]] (* A191122 *)
%t b = (a + 1)/3; c = a/4; r = Range[1, 1500];
%t d = Intersection[b, r] (* A191168 *)
%t e = Intersection[c, r] (* A191169 *)
%o (Haskell)
%o import Data.Set (singleton, deleteFindMin, insert)
%o a191122 n = a191122_list !! (n-1)
%o a191122_list = f $ singleton 1
%o where f s = m : (f $ insert (3*m-1) $ insert (4*m) s')
%o where (m, s') = deleteFindMin s
%o -- _Reinhard Zumkeller_, Jun 01 2011
%Y Cf. A191113.
%K nonn
%O 1,2
%A _Clark Kimberling_, May 27 2011