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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127915 a(1)=1, a(2)=2. For n >= 3, a(n) is the smallest positive integer not occurring earlier in the sequence such that floor(a(n)/a(n-1)) does not equal floor(a(n-1)/a(n-2)). 4
 1, 2, 3, 6, 4, 5, 10, 7, 8, 16, 9, 11, 22, 12, 13, 26, 14, 15, 30, 17, 18, 36, 19, 20, 40, 21, 23, 46, 24, 25, 50, 27, 28, 56, 29, 31, 62, 32, 33, 66, 34, 35, 70, 37, 38, 76, 39, 41, 82, 42, 43, 86, 44, 45, 90, 47, 48, 96, 49, 51, 102, 52, 53, 106, 54, 55, 110, 57, 58, 116, 59 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS This sequence is a permutation of the positive integers. LINKS Ivan Neretin, Table of n, a(n) for n = 1..10000 MATHEMATICA a = {1, 2}; For[n = 3, n < 60, n++, i = 3; While[Length[Intersection[{i}, a]] == 1 || Floor[i/a[[ -1]]] == Floor[a[[ -1]]/a[[ -2]]], i++ ]; AppendTo[a, i]]; a (* Stefan Steinerberger, Oct 16 2007 *) CROSSREFS Sequence in context: A194052 A178484 A222758 * A331117 A282841 A254106 Adjacent sequences:  A127912 A127913 A127914 * A127916 A127917 A127918 KEYWORD nonn AUTHOR Leroy Quet, Apr 06 2007 EXTENSIONS More terms from Stefan Steinerberger, Oct 16 2007 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 05:41 EST 2022. Contains 350464 sequences. (Running on oeis4.)