Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089080
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A089080
%S A089080 1,2,3,2,4,2,3,2,5,2,3,2,4,2,3,2,6,2,3,2,4,2,3,2,5,2,3,2,4,2,3,2,7,2,3,
%T A089080 2,4,2,3,2,5,2,3,2,4,2,3,2,6,2,3,2,4,2,3,2,5,2,3,2,4,2,3,2,8,2,3,2,4,2,
%U A089080 3,2,5,2,3,2,4,2,3,2,6,2,3,2,4,2,3,2,5,2,3,2,4,2,3,2,7,2,3,2,4,2,3,2,5
%N A089080 Sequence is S(infinity) where S(1)={1,2} and S(n)=S(n-1)S'(n-1), where 
               S'(k) is obtained from S(k) by replacing the single 1 by the least 
               integer not occurring in S(k).
%F A089080 sum(k=1, n, a(k))= 3*n+O(log(n)) ( sum(k=1, n, a(k))< 3*n )
%e A089080 S(1)={1,2} then S'(1)={3,2} and sequence begins 1,2,3,2
%Y A089080 Essentially the same as A085058.
%Y A089080 Sequence in context: A050206 A127237 A066482 this_sequence A123725 A085058 
               A080771
%Y A089080 Adjacent sequences: A089077 A089078 A089079 this_sequence A089081 A089082 
               A089083
%K A089080 nonn
%O A089080 1,2
%A A089080 Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 04 2003

    
page 1

Search completed in 0.001 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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research