OFFSET
1,2
COMMENTS
See A191113.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
MATHEMATICA
h = 3; i = -2; j = 4; k = 1; f = 1; g = 9;
a = Union[Flatten[NestList[{h # + i, j # + k} &, f, g]]] (* A191116 *)
b = (a + 2)/3; c = (a - 1)/4; r = Range[1, 1500];
d = Intersection[b, r] (* A191155 *)
e = Intersection[c, r] (* A191129 *)
m = (a + 1)/2 (* divisibility property *)
p = (a + 3)/4 (* divisibility property *)
q = (a + 3)/8 (* divisibility property *)
PROG
(Haskell)
import Data.Set (singleton, deleteFindMin, insert)
a191116 n = a191116_list !! (n-1)
a191116_list = 1 : f (singleton 5)
where f s = m : (f $ insert (3*m-2) $ insert (4*m+1) s')
where (m, s') = deleteFindMin s
-- Reinhard Zumkeller, Jun 01 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 27 2011
STATUS
approved