|
Search: id:A079948
|
|
| |
|
| 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, 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, 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Alternate description of sequence: start with a(1)=3; apply 1->2, 2->11, 3->21; iterate. - Matthew Vandermast (ghodges14(AT)comcast.net), Mar 08 2003
|
|
REFERENCES
|
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.
|
|
LINKS
|
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)
N. J. A. Sloane, Seven Staggering Sequences.
|
|
FORMULA
|
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, ...
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
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
|
|
CROSSREFS
|
Sequence in context: A073356 A093032 A072115 this_sequence A106689 A027082 A140736
Adjacent sequences: A079945 A079946 A079947 this_sequence A079949 A079950 A079951
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 22 2003
|
|
|
Search completed in 0.002 seconds
|
