Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080460
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A080460
%S A080460 2,2,6,10,14,14,18,22,26,26,30,34,38,38,42,46,50,50,54,58,62,62,66,
%T A080460 70,74,74,78,82,86,86,90,94,98,98,102,106,110,110,114,118,122,122,
%U A080460 126,130,134,134,138,142,146,146,150,154,158,158,162,166,170,170
%N A080460 a(1)=2; for n>1, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+4 
               otherwise.
%H A080460 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 A080460 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 A080460 a(n) = 2+4*(n-2-floor((n-2)/4)).
%Y A080460 Cf. A080455-A080458, A080036, A080037.
%Y A080460 Sequence in context: A051765 A077063 A081728 this_sequence A077017 A127404 
               A165941
%Y A080460 Adjacent sequences: A080457 A080458 A080459 this_sequence A080461 A080462 
               A080463
%K A080460 nonn
%O A080460 1,1
%A A080460 N. J. A. Sloane (njas(AT)research.att.com) and Benoit Cloitre, Mar 22 
               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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research