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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080901 a(1)=2; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise. 5
2, 0, 5, 10, 8, 13, 18, 16, 21, 19, 24, 29, 27, 32, 37, 35, 40, 38, 36, 41, 39, 44, 49, 47, 52, 57, 55, 60, 58, 63, 68, 66, 71, 76, 74, 72, 70, 68, 66, 64, 62, 67, 72, 70, 75, 80, 78, 83, 81, 86, 91, 89, 94, 99, 97, 102, 100, 98, 103, 101, 106, 104, 102, 100 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..64.

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) (A081745) is periodic with period 168.

CROSSREFS

Cf. A080578, A080900, A081745.

Sequence in context: A139309 A011014 A002976 * A137260 A219765 A153059

Adjacent sequences:  A080898 A080899 A080900 * A080902 A080903 A080904

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane and Benoit Cloitre, Apr 01 2003

STATUS

approved

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 May 24 22:42 EDT 2013. Contains 225631 sequences.