|
%I #18 Aug 11 2014 22:45:45
%S 0,3,6,7,12,13,14,15,24,25,26,27,28,30,31,48,49,50,51,52,54,55,56,59,
%T 60,61,62,63,96,97,98,99,100,102,103,104,107,108,109,110,111,112,115,
%U 118,119,120,121,122,123,124,125,126,127,192,193,194,195,196,198,199
%N Values taken by A161903, sorted and duplicates removed.
%C The sequence contains 2k if and only if it contains k.
%C If the binary expansion of n has k bits, then A161903(n) will have k+1 bits. Thus, to determine if a number with m bits belongs to the sequence, it is sufficient to check A161903(i) up to i=2^(m-1)-1.
%H T. D. Noe, <a href="/A186083/b186083.txt">Table of n, a(n) for n = 1..1309</a>
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Rule110.html">Rule 110</a>
%t f[n_] := FromDigits[Drop[Part[CellularAutomaton[110, {IntegerDigits[n, 2], 0}], 1], -1], 2]; Union[Table[f[n], {n, 0, 2047}]]
%Y Cf. A161903.
%K nonn
%O 1,2
%A _Ben Branman_, Feb 12 2011
|
