Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098153
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A098153
%S A098153 1,11,101,10101,100111,1001001,1000111,1101001,1101001,1101001,1101001,
%T A098153 1101001,1101001,1101001,1101001,1101001,1101001,1101001,1101001,
%U A098153 1101001,1101001,1101001,1101001,1101001,1101001,1101001,1101001
%N A098153 Summarize the previous term in binary (in increasing order).
%C A098153 Similar to A005151 but uses base 2: Let a(1)=1. Describing a(1) as "one 
               1" again gives a(2)=11 (same digit string as A005151 and similar 
               sequences), but describing a(2) as "two 1's" gives a(3)=101 when 
               the frequency of digit occurrence is written in binary and followed 
               by the digit counted.
%F A098153 a(n) = 1101001 for all n >= 8 (see example).
%e A098153 Summarizing a(8) = 1101001 in increasing digit order, there are "three 
               0's, four 1's", so concatenating 11 0 100 1 gives a(9) = 1101001 
               (=a(10)=a(11)=...).
%Y A098153 Cf. A098154 (ternary), A098155 (base 4), A005151 (decimal and digit strings 
               for all other bases b >= 5).
%Y A098153 Sequence in context: A080176 A064490 A080439 this_sequence A020449 A089971 
               A082620
%Y A098153 Adjacent sequences: A098150 A098151 A098152 this_sequence A098154 A098155 
               A098156
%K A098153 base,easy,nonn
%O A098153 1,2
%A A098153 Rick L. Shepherd (rshepherd2(AT)hotmail.com), Aug 29 2004

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research