A132679 Starting with a(1)=1 and a(2)=2: if m is a term then also 4*m and 4*m+3.

1, 2, 4, 7, 8, 11, 16, 19, 28, 31, 32, 35, 44, 47, 64, 67, 76, 79, 112, 115, 124, 127, 128, 131, 140, 143, 176, 179, 188, 191, 256, 259, 268, 271, 304, 307, 316, 319, 448, 451, 460, 463, 496, 499, 508, 511, 512, 515, 524, 527, 560, 563, 572, 575, 704, 707, 716

Offset: 1

Author

Reinhard Zumkeller, Aug 26 2007

Keywords

• nonn

Comments

Subsequence of A000069; A010060(a(n))=1; A000120(a(n)) mod 2 = 1;

A000079, A083420, A002042, A002089 are subsequences.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
• Eric Weisstein's World of Mathematics, Odious Number
• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A179888. [From Reinhard Zumkeller, Jul 31 2010]

Programs

Haskell

import Data.Set (fromList, insert, deleteFindMin)
a132679 n = a132679_list !! (n-1)
a132679_list = f $ fromList [1,2] where
   f s = m : f (insert (4*m) $ insert (4*m+3) s') where
       (m,s') = deleteFindMin s
-- Reinhard Zumkeller, Oct 29 2011

Mathematica

Union[Nest[Flatten[{#,4#,4#+3}]&,{1,2},4]] (* Harvey P. Dale, Aug 02 2013 *)