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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140592 a(n) = 2n if A010060(n-1) is 0, and a(n) = 2n+1 if A010060(n-1) is 1. 1

%I

%S 2,5,7,8,11,12,14,17,19,20,22,25,26,29,31,32,35,36,38,41,42,45,47,48,

%T 50,53,55,56,59,60,62,65,67,68,70,73,74,77,79,80,82,85,87,88,91,92,94,

%U 97,98,101,103,104,107,108,110,113,115,116,118,121,122,125,127,128

%N a(n) = 2n if A010060(n-1) is 0, and a(n) = 2n+1 if A010060(n-1) is 1.

%H G. C. Greubel, <a href="/A140592/b140592.txt">Table of n, a(n) for n = 1..8192</a>

%F a(n) = A001969(n) + 2. - _R. J. Mathar_, Sep 10 2013

%t Clear[a, b, c, d] (*A010060*) ThueMorse[n_, b_] := NestList[ Flatten[ # /. {0 -> {0, 1}, 1 -> {1, 0}}] &, {b}, n]; b = ThueMorse[7, 0][[7]]; c = Table[If[b[[n]] == 0, 2*n, 2*n + 1], {n, 1, Length[b]}]

%Y Cf. A010060.

%K nonn,less

%O 1,1

%A _Roger L. Bagula_ and _Gary W. Adamson_, Jul 06 2008

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.

Last modified January 29 04:46 EST 2020. Contains 331335 sequences. (Running on oeis4.)