The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080939 a(1)=3; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise. 2
 3, 8, 6, 11, 16, 14, 19, 17, 22, 27, 25, 30, 35, 33, 38, 36, 34, 39, 37, 42, 47, 45, 50, 55, 53, 58, 56, 61, 66, 64, 69, 74, 72, 70, 68, 66, 64, 62, 60, 65, 70, 68, 73, 78, 76, 81, 79, 84, 89, 87, 92, 97, 95, 100, 98, 96, 101, 99, 104, 102, 100, 98, 103, 101, 99 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..65. B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2. B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308) FORMULA a(n)-n (n >= 1) is periodic with period 168. CROSSREFS Cf. A080578, A080900, A080901. Sequence in context: A021725 A371472 A295573 * A155724 A289485 A304299 Adjacent sequences: A080936 A080937 A080938 * A080940 A080941 A080942 KEYWORD nonn,easy AUTHOR N. J. A. Sloane and Benoit Cloitre, Apr 04 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 12 08:52 EDT 2024. Contains 374239 sequences. (Running on oeis4.)