login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,2
COMMENTS
This sequence is a permutation of the positive integers.
LINKS
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 * A361966 A358026 A331117
KEYWORD
nonn
AUTHOR
Leroy Quet, Apr 06 2007
EXTENSIONS
More terms from Stefan Steinerberger, Oct 16 2007
STATUS
approved