login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191130 Increasing sequence generated by these rules:  a(1)=1, and if x is in a then 3x and 4x+2 are in a. 5
1, 3, 6, 9, 14, 18, 26, 27, 38, 42, 54, 58, 74, 78, 81, 106, 110, 114, 126, 154, 162, 170, 174, 218, 222, 234, 243, 298, 314, 318, 326, 330, 342, 378, 426, 442, 458, 462, 486, 506, 510, 522, 618, 650, 654, 666, 682, 698, 702, 729, 874, 890, 894, 938, 942, 954, 974, 978, 990, 1026, 1134, 1194, 1258, 1274, 1278, 1306, 1322, 1326 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

See A191113.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

MATHEMATICA

h = 3; i = 0; j = 4; k = 2; f = 1; g = 9;

a = Union[Flatten[NestList[{h # + i, j # + k} &, f, g]]]  (* A191130 *)

b = a/3; c = (a - 2)/4; r = Range[1, 1500];

d = Intersection[b, r] (* A191184 *)

e = Intersection[c, r] (* A191185 *)

PROG

(Haskell)

import Data.Set (singleton, deleteFindMin, insert)

a191130 n = a191130_list !! (n-1)

a191130_list = f $ singleton 1

   where f s = m : (f $ insert (3*m) $ insert (4*m+2) s')

             where (m, s') = deleteFindMin s

-- Reinhard Zumkeller, Jun 01 2011

CROSSREFS

Cf. A191113.

Sequence in context: A027424 A294476 A258087 * A319738 A310165 A310166

Adjacent sequences:  A191127 A191128 A191129 * A191131 A191132 A191133

KEYWORD

nonn

AUTHOR

Clark Kimberling, May 27 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 8 14:04 EDT 2020. Contains 336298 sequences. (Running on oeis4.)