Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080199
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A080199
%S A080199 1,7,13,19,25,31,28,34,40,46,52,58,55,61,67,73,79,85,82,88,94,100,
%T A080199 106,112,109,115,121,118,124,130,127,133,139,136,142,148,154,160,
%U A080199 166,163,169,175,181,187,193,190,196,202,208,214,220,217,223,229
%N A080199 a(1)=1; for n>1, a(n)=a(n-1) - 3 if n is already in the sequence, a(n)=a(n-1) 
               + 6 otherwise.
%H A080199 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/
               journals/JIS/index.html">Numerical analogues of Aronson's sequence</
               a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H A080199 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/
               abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a> 
               (math.NT/0305308)
%F A080199 a(n) = 3*n*(1 + 1/log_3(n)) + o(n).
%Y A080199 Cf. A080455-A080458, A080036, A080037.
%Y A080199 Sequence in context: A035497 A059335 A070419 this_sequence A016921 A123843 
               A004082
%Y A080199 Adjacent sequences: A080196 A080197 A080198 this_sequence A080200 A080201 
               A080202
%K A080199 nonn
%O A080199 1,2
%A A080199 N. J. A. Sloane (njas(AT)research.att.com), Mar 20 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 4 12:48 EST 2009. Contains 170310 sequences.


AT&T Labs Research