This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080903 a(1)=1; for n>1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+2 otherwise. 1
 1, 3, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37, 39, 41, 45, 47, 51, 53, 55, 57, 61, 63, 67, 69, 71, 73, 77, 79, 83, 85, 87, 89, 93, 95, 99, 101, 105, 107, 111, 113, 115, 117, 121, 123, 127, 129, 131, 133, 137, 139, 143, 145, 149, 151, 155, 157, 159 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Ivan Neretin, Table of n, a(n) for n = 1..1000 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, arXiv:math/0305308 [math.NT], 2003. MATHEMATICA Fold[Append[#1, #1[[-1]] + If[MemberQ[#1, #2], 4, 2]] &, {1}, Range[2, 59]] (* Ivan Neretin, Mar 03 2016 *) CROSSREFS Cf. A080578, A080900. Sequence in context: A045572 A069254 A105585 * A172253 A104381 A136333 Adjacent sequences:  A080900 A080901 A080902 * A080904 A080905 A080906 KEYWORD nonn AUTHOR 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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 21 16:27 EST 2017. Contains 295003 sequences.