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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127914 a(1)=1. For n >= 2, a(n) is the smallest positive integer not occurring earlier in the sequence such that floor(a(n)/n) does not equal floor(a(n-1)/(n-1)). 0

%I #9 Sep 16 2015 04:57:53

%S 1,4,2,5,3,6,14,7,9,8,11,10,13,12,15,32,16,18,17,20,19,22,21,24,23,26,

%T 25,28,27,30,29,33,31,34,70,35,37,36,39,38,41,40,43,42,45,44,47,46,49,

%U 48,51,50,53,52,55,54,57,56,59,58,61,60,63,62,65,64,67,66,69

%N a(1)=1. For n >= 2, a(n) is the smallest positive integer not occurring earlier in the sequence such that floor(a(n)/n) does not equal floor(a(n-1)/(n-1)).

%t a = {1}; For[n = 2, n < 70, n++, i = 1; While[Length[Intersection[a, {i}]] == 1 || Floor[i/n] == Floor[a[[ -1]]/(n - 1)], i++ ]; AppendTo[a, i]]; a (* _Stefan Steinerberger_, Oct 26 2007 *)

%K nonn

%O 1,2

%A _Leroy Quet_, Apr 06 2007

%E More terms from _Stefan Steinerberger_, Oct 26 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 07:20 EDT 2024. Contains 371235 sequences. (Running on oeis4.)