_Reinhard Zumkeller_, , <a href="/A190808/b190808.txt">Table of n, a(n) for n = 1..10000</a>
_Reinhard Zumkeller_, , <a href="/A190808/b190808.txt">Table of n, a(n) for n = 1..10000</a>
_Reinhard Zumkeller, _, <a href="/A190808/b190808.txt">Table of n, a(n) for n = 1..10000</a>
-- _Reinhard Zumkeller, _, Jun 01 2011
_Clark Kimberling (ck6(AT)evansville.edu), _, May 20 2011
a(55)=224 inserted by _Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, Jun 01 2011
proposed
approved
1, 2, 4, 7, 8, 13, 14, 16, 22, 25, 26, 28, 32, 40, 43, 44, 49, 50, 52, 56, 64, 67, 76, 79, 80, 85, 86, 88, 97, 98, 100, 104, 112, 121, 128, 130, 133, 134, 148, 151, 152, 157, 158, 160, 169, 170, 172, 176, 193, 194, 196, 200, 202, 208, 224, 229, 238, 241, 242, 256, 259, 260, 265, 266, 268, 292, 295, 296
Reinhard Zumkeller, <a href="/A190808/b190808.txt">Table of n, a(n) for n = 1..10000</a>
(Haskell)
import Data.Set (singleton, deleteFindMin, insert)
a190808 n = a190808_list !! (n-1)
a190808_list = f $ singleton 1
where f s = m : (f $ insert (2*m) $ insert (3*m+1) s')
where (m, s') = deleteFindMin s
-- Reinhard Zumkeller, Jun 01 2011
a(55)=224 inserted by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 01 2011
approved
proposed
proposed
approved
allocated for Clark KimberlingIncreasing sequence generated by these rules: a(1)=1, and if x is in a then 2x and 3x+1 are in a.
1, 2, 4, 7, 8, 13, 14, 16, 22, 25, 26, 28, 32, 40, 43, 44, 49, 50, 52, 56, 64, 67, 76, 79, 80, 85, 86, 88, 97, 98, 100, 104, 112, 121, 128, 130, 133, 134, 148, 151, 152, 157, 158, 160, 169, 170, 172, 176, 193, 194, 196, 200, 202, 208, 229, 238, 241, 242, 256, 259, 260, 265, 266, 268, 292, 295, 296
1,2
See A190803.
h = 2; i = 0; j = 3; k = 1; f = 1;
a = Union[Flatten[NestList[{h # + i, j # + k} &, f, 7]]]
Cf. A190803.
allocated
nonn
Clark Kimberling (ck6(AT)evansville.edu), May 20 2011
approved
proposed
allocated for Clark Kimberling
allocated
approved