|
%I #9 Jul 13 2013 12:04:10
%S 1,3,9,27,33,81,99,105,129,243,297,315,321,387,393,417,513,729,891,
%T 945,963,969,1161,1179,1185,1251,1257,1281,1539,1545,1569,1665,2049,
%U 2187,2673,2835,2889,2907,2913,3483,3537,3555,3561,3753,3771,3777,3843,3849,3873,4617,4635,4641,4707,4713,4737,4995,5001,5025,5121
%N Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x and 4x-3 are in a.
%C See A191113.
%H Reinhard Zumkeller, <a href="/A191126/b191126.txt">Table of n, a(n) for n = 1..10000</a>
%t h = 3; i = 0; j = 4; k = -3; f = 1; g = 9;
%t a = Union[Flatten[NestList[{h # + i, j # + k} &, f, g]]] (* A191126 *)
%t b = a/3; c = (a + 3)/4; r = Range[1, 1500];
%t d = Intersection[b, r] (* A191176 *)
%t e = Intersection[c, r] (* A191177 *)
%t m = a/3 (* divisibility property *)
%t p = (a + 3)/6 (* divisibility property *)
%o (Haskell)
%o import Data.Set (singleton, deleteFindMin, insert)
%o a191126 n = a191126_list !! (n-1)
%o a191126_list = 1 : f (singleton 3)
%o where f s = m : (f $ insert (3*m) $ insert (4*m-3) 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
|
