|
%I #11 Jul 20 2021 14:46:02
%S 1,2,3,6,9,10,18,22,27,30,34,38,54,66,70,81,86,90,102,106,114,118,134,
%T 150,162,198,210,214,243,258,262,270,278,306,318,322,342,354,358,402,
%U 406,422,450,454,470,486,534,594,598,630,642,646,729,774,786,790,810,834,838,854,918,954,966,970,1026,1030,1046,1062,1074,1078
%N Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x and 4x-2 are in a.
%C See A191113.
%H Reinhard Zumkeller, <a href="/A191127/b191127.txt">Table of n, a(n) for n = 1..10000</a>
%t h = 3; i = 0; j = 4; k = -2; f = 1; g = 9;
%t a = Union[Flatten[NestList[{h # + i, j # + k} &, f, g]]] (* A191127 *)
%t b = a/3; c = (a + 2)/4; r = Range[1, 1500];
%t d = Intersection[b, r] (* A191178 *)
%t e = Intersection[c, r] (* A191179 *)
%t Nest[Flatten[{#,3#,4#-2}]&,1,7]//Union (* _Harvey P. Dale_, Jul 20 2021 *)
%o (Haskell)
%o import Data.Set (singleton, deleteFindMin, insert)
%o a191127 n = a191127_list !! (n-1)
%o a191127_list = f $ singleton 1
%o where f s = m : (f $ insert (3*m) $ insert (4*m-2) s')
%o where (m, s') = deleteFindMin s
%o -- _Reinhard Zumkeller_, Jun 01 2011
%Y Cf. A191119, A191178, A191179.
%K nonn
%O 1,2
%A _Clark Kimberling_, May 27 2011
|
