|
%I #35 Mar 25 2019 04:25:44
%S 0,10,1110,11110,100110,1110010110,111100111010110,
%T 100110011110111010110,1110010110010011011110111010110,
%U 1111001110101100111001011010011011110111010110,1001100111101110101100111100111010110111001011010011011110111010110
%N Describe the previous term in binary (method A - initial term is 0).
%C Method A = 'frequency' (in binary mode) followed by 'digit'-indication.
%C The number of digits of a(n) is A001609(n) except for n = 2. See the link from T. Sillke below. - _Jianing Song_, Mar 16 2019
%H Kade Robertson, <a href="/A049064/b049064.txt">Table of n, a(n) for n = 1..18</a>
%H Kade Robertson, <a href="/A049064/a049064.txt">Table of n, a(n) for n = 1..31</a>
%H T. Sillke, <a href="http://www.mathematik.uni-bielefeld.de/~sillke/SEQUENCES/series001">The binary form of Conway's sequence</a>
%F a(n) = A001391(n-1), n > 1. - _R. J. Mathar_, Oct 15 2008
%e E.g., the term after 11110 is obtained by saying "four (i.e., 100 in binary mode) 1, one 0", which gives 100110.
%Y Cf. A001387 (initial term is 1), A001391, A001609 (number of digits), A259710 (written in decimal).
%Y Decimal look-and-say sequences: A005150, A006751, A006715, A001140, A001141, A001143, A001145, A001151, A001154.
%K base,easy,nice,nonn
%O 1,2
%A _Olivier de Mouzon_
%E Edited by _Charles R Greathouse IV_, Apr 06 2010
%E a(11) from _Kade Robertson_, Jun 24 2015
%E Offset corrected by _Jianing Song_, Mar 16 2019
|
