login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191125 Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-1 and 4x+3 are in a. 4
1, 2, 5, 7, 11, 14, 20, 23, 31, 32, 41, 47, 59, 68, 83, 92, 95, 122, 127, 131, 140, 167, 176, 191, 203, 239, 248, 275, 284, 335, 365, 371, 380, 383, 392, 419, 491, 500, 511, 527, 563, 572, 608, 671, 707, 716, 743, 767, 815, 824, 851, 959, 995, 1004, 1094, 1103, 1112, 1139, 1148, 1175, 1256, 1343, 1463, 1472, 1487, 1499, 1523 (list; graph; refs; listen; history; text; internal format)
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]]] (* A191125 *)
b = (a + 1)/3; c = (a - 3)/4; r = Range[1, 1500];
d = Intersection[b, r] (* A191174 *)
e = Intersection[c, r] (* A191175 *)
PROG
(Haskell)
import Data.Set (singleton, deleteFindMin, insert)
a191125 n = a191125_list !! (n-1)
a191125_list = f $ singleton 1
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: A351897 A184676 A191175 * A001225 A157001 A134640
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 22:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)