login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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
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, 25, 28, 27, 30, 29, 33, 31, 34, 70, 35, 37, 36, 39, 38, 41, 40, 43, 42, 45, 44, 47, 46, 49, 48, 51, 50, 53, 52, 55, 54, 57, 56, 59, 58, 61, 60, 63, 62, 65, 64, 67, 66, 69 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..69.

MATHEMATICA

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

CROSSREFS

Sequence in context: A065187 A185511 A199855 * A218035 A090964 A219159

Adjacent sequences:  A127911 A127912 A127913 * A127915 A127916 A127917

KEYWORD

nonn

AUTHOR

Leroy Quet, Apr 06 2007

EXTENSIONS

More terms from Stefan Steinerberger, Oct 26 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 02:40 EST 2021. Contains 349469 sequences. (Running on oeis4.)