cp's OEIS Frontend

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)).

%I A127915 #15 May 02 2019 15:44:52
%S A127915 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,
%T A127915 23,46,24,25,50,27,28,56,29,31,62,32,33,66,34,35,70,37,38,76,39,41,82,
%U A127915 42,43,86,44,45,90,47,48,96,49,51,102,52,53,106,54,55,110,57,58,116,59
%N 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)).
%C A127915 This sequence is a permutation of the positive integers.
%H A127915 Ivan Neretin, <a href="/A127915/b127915.txt">Table of n, a(n) for n = 1..10000</a>
%t A127915 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 *)
%K A127915 nonn
%O A127915 1,2
%A A127915 _Leroy Quet_, Apr 06 2007
%E A127915 More terms from _Stefan Steinerberger_, Oct 16 2007