Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082846
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A082846
%S A082846 1,2,3,1,2,3,1,2,2,3,1,3,1,2,2,3,2,3,1,3,1,2,3,3,1,2,2,3,2,3,1,3,1,2,3,
%T A082846 1,3,1,2,3,3,1,2,2,3,1,3,1,2,3,1,2,2,3,2,3,1,3,1,2,3,1,3,1,2,3,3,1,2,2,
%U A082846 3,1,3,1,2,3,3,1,2,2,3,1,3,1,2,3,1,2,2
%N A082846 a(1) = 1, a(2) = 2, a(3) = 3; then a(a(1)+a(2)+..+a(k)) = a(k) and fill 
               the "holes" using the rule : a(m) = 1 if a(m-1) = 3, a(m) = 2 if 
               a(m-1) = 1, a(m) = 3 if a(m-1) = 2.
%F A082846 It seems that limit n ->infinity (1/n)*sum(k=1, n, a(k))= C >2 (C=2.07...)
%e A082846 a(1)+a(2)+a(3)=6 so a(6)=a(3)=3. Since a(3)=3 a(4)=1 therefore a(5)=2 
               and sequence begins : 1,2,3,1,2,3,
%Y A082846 Cf. A082847.
%Y A082846 Sequence in context: A053839 A047896 A073645 this_sequence A117373 A132677 
               A010882
%Y A082846 Adjacent sequences: A082843 A082844 A082845 this_sequence A082847 A082848 
               A082849
%K A082846 nonn
%O A082846 1,2
%A A082846 Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 14 2003

    
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