login
This site is supported by donations to The OEIS Foundation.
Logo

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; internal format)
OFFSET

1,1

LINKS

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: A152683 A083700 A021725 * A155724 A098737 A164654

Adjacent sequences:  A080936 A080937 A080938 * A080940 A080941 A080942

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com) and Benoit Cloitre, Apr 04 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 23:45 EST 2012. Contains 206085 sequences.