login
A191119
Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-1 and 4x-3 are in a.
5
1, 2, 5, 14, 17, 41, 50, 53, 65, 122, 149, 158, 161, 194, 197, 209, 257, 365, 446, 473, 482, 485, 581, 590, 593, 626, 629, 641, 770, 773, 785, 833, 1025, 1094, 1337, 1418, 1445, 1454, 1457, 1742, 1769, 1778, 1781, 1877, 1886, 1889, 1922, 1925, 1937, 2309, 2318, 2321, 2354, 2357, 2369, 2498, 2501, 2513, 2561, 3074, 3077
OFFSET
1,2
COMMENTS
See A191113.
LINKS
MATHEMATICA
h = 3; i = -1; j = 4; k = -3; f = 1; g = 9;
a = Union[Flatten[NestList[{h # + i, j # + k} &, f, g]]] (* A191119 *)
b = (a + 1)/3; c = (a + 3)/4; r = Range[1, 1500];
d = Intersection[b, r] (* A191120 *)
e = Intersection[c, r] (* A191163 *)
PROG
(Haskell)
import Data.Set (singleton, deleteFindMin, insert)
a191119 n = a191119_list !! (n-1)
a191119_list = 1 : f (singleton 2)
where f s = m : (f $ insert (3*m-1) $ insert (4*m-3) s')
where (m, s') = deleteFindMin s
-- Reinhard Zumkeller, Jun 01 2011
CROSSREFS
Cf. A191113.
Sequence in context: A046058 A137271 A131356 * A089410 A118670 A228958
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 27 2011
STATUS
approved