Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082844
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A082844
%S A082844 3,2,3,2,2,3,2,3,2,2,3,2,3,2,3,2,2,3,2,3,2,2,3,2,3,2,3,2,2,3,2,3,2,2,3,
%T A082844 2,3,2,2,3,2,3,2,3,2,2,3,2,3,2,2,3,2,3,2,3,2,2,3,2,3,2,2,3,2,3,2,2,3,2,
%U A082844 3,2,3,2,2,3,2,3,2,2,3,2,3,2,3,2,2,3,2,3,2,2,3,2,3,2,3,2,2,3,2,3,2,2,3
%N A082844 Start with 3,2 and apply the rule a(a(1)+a(2)+...+a(n))=a(n), fill in 
               any undefined terms by the rule that a(t) = 2 if a(t-1) = 3 and a(t) 
               = 3 if a(t-1) = 2.
%C A082844 a(1)= 3, a(2)=2, a(a(1)+a(2)+...+a(n))=a(n) and a(a(1)+a(2)+...+a(n)+1)=5-a(n).
%C A082844 More generally, sequence a(n)=floor(r*(n+2))-floor(r*(n+1)), r= (1/2) 
               *(z+sqrt(z^2+4)), z integer >=1, is defined with a(1), a(2) and a(a(1)+a(2)+...+a(n)+f(z))=a(n); 
               a(a(1)+a(2)+...+a(n)+f(z)+1)=(2z+1)-a(n) where f(1)=0, f(z)=z-2 for 
               z>=2.
%F A082844 a(n)=floor(r*(n+2))-floor(r*(n+1)) where r=1+sqrt(2)
%Y A082844 Cf. A082389, A082845.
%Y A082844 Sequence in context: A064654 A162229 A056564 this_sequence A101406 A097509 
               A095206
%Y A082844 Adjacent sequences: A082841 A082842 A082843 this_sequence A082845 A082846 
               A082847
%K A082844 nonn
%O A082844 1,1
%A A082844 Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 15 2003; revised Jun 07 
               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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research