cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A124108 Replace each 1 with 10 in binary representation of n.

This page as a plain text file.
%I A124108 #13 May 20 2021 18:37:25
%S A124108 0,2,4,10,8,18,20,42,16,34,36,74,40,82,84,170,32,66,68,138,72,146,148,
%T A124108 298,80,162,164,330,168,338,340,682,64,130,132,266,136,274,276,554,
%U A124108 144,290,292,586,296,594,596,1194,160,322,324,650,328,658,660,1322,336,674
%N A124108 Replace each 1 with 10 in binary representation of n.
%C A124108 A070939(a(n)) = A056791(n);
%C A124108 A023416(a(n)) = A023416(n) + A000120(n); A000120(a(n)) = A000120(n).
%H A124108 Reinhard Zumkeller, <a href="/A124108/b124108.txt">Table of n, a(n) for n = 0..10000</a>
%H A124108 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%t A124108 Table[FromDigits[Flatten[IntegerDigits[n,2]/.(1->{1,0})],2],{n,0,60}] (* _Harvey P. Dale_, May 20 2021 *)
%o A124108 (Haskell)
%o A124108 a124108 0 = 0
%o A124108 a124108 x = 2 * (b + 1) * a124108 x' + (b * 2)
%o A124108             where (x', b) = divMod x 2
%o A124108 -- _Reinhard Zumkeller_, Mar 31 2015
%Y A124108 Cf. A023416, A000120, A056791, A070939, A048678, A007088.
%K A124108 nonn
%O A124108 0,2
%A A124108 _Reinhard Zumkeller_, Nov 26 2006
%E A124108 Offset fixed by _Reinhard Zumkeller_, Mar 31 2015