|
%I #10 Jul 13 2013 12:04:09
%S 1,3,7,11,19,27,31,43,55,75,79,91,107,123,127,163,171,219,223,235,271,
%T 299,315,319,363,367,379,427,487,491,507,511,651,655,667,683,703,811,
%U 875,891,895,939,943,955,1083,1087,1099,1135,1195,1259,1275,1279,1451,1459,1467,1471,1515,1519,1531,1707,1947,1951,1963,1999
%N Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-2 and 4x-1 are in a.
%C See A191113.
%H Reinhard Zumkeller, <a href="/A191114/b191114.txt">Table of n, a(n) for n = 1..10000</a>
%t h = 3; i = -2; j = 4; k = -1; f = 1; g = 8;
%t a = Union[Flatten[NestList[{h # + i, j # + k} &, f, g]]] (* A191114 *)
%t b = (a + 2)/3; c = (a + 1)/4; r = Range[1, 1200];
%t d = Intersection[b, r] (* A191121 *)
%t e = Intersection[c, r] (* A191152 *)
%t m = (a + 1)/2 (* divisibility property *)
%t p = (a + 1)/4 (* divisibility property *)
%o (Haskell)
%o import Data.Set (singleton, deleteFindMin, insert)
%o a191114 n = a191114_list !! (n-1)
%o a191114_list = 1 : f (singleton 3)
%o where f s = m : (f $ insert (3*m-2) $ insert (4*m-1) 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
|
