|
%I #16 Sep 02 2018 08:23:55
%S 3,2,1,1,1,2,2,2,1,1,1,1,1,1,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,2,2,
%T 2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1
%N First differences of A079000.
%C Alternate description of sequence: start with a(1)=3; apply 1->2, 2->11, 3->21; iterate. - _Matthew Vandermast_, Mar 08 2003
%D N. J. A. Sloane, Seven Staggering Sequences, in Homage to a Pied Puzzler, E. Pegg Jr., A. H. Schoen and T. Rodgers (editors), A. K. Peters, Wellesley, MA, 2009, pp. 93-110.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="https://arxiv.org/abs/math/0305308">Numerical analogues of Aronson's sequence</a>, arXiv:math/0305308 [math.NT], 2003.
%H N. J. A. Sloane, <a href="http://neilsloane.com/doc/g4g7.pdf">Seven Staggering Sequences</a>.
%F After first two terms, a run of length 3*2^k 1's followed by a run of length 3*2^k 2's, for k = 0, 1, ...
%F a(n) = floor(log_2(8*(floor((n+3)/3))/3)) - floor(log_2(floor((n+3)/3))) for n>2; with a(1)=3 and a(2)=2. - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 22 2003
%F Also a(n) = A079882(A002264(n+3)) for n>2, where A002264=floor(n/3). - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 22 2003
%t b[1] = 1; b[n_] := (k = Floor[Log[2, (n+3)/6]]; j = n - (9*2^k-3); 12*2^k - 3 + 3*j/2 + Abs[j]/2); Array[b, 106] // Differences (* _Jean-François Alcover_, Sep 02 2018 *)
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Feb 22 2003
|
