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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236266 Lexicographically earliest sequence of nonnegative integers such that no three points (i,a(i)), (j,a(j)), (n,a(n)) are collinear. 7
 0, 0, 1, 1, 4, 3, 8, 2, 2, 5, 7, 4, 5, 8, 16, 3, 7, 14, 12, 23, 16, 12, 25, 31, 13, 6, 11, 28, 11, 17, 9, 9, 22, 34, 6, 15, 13, 29, 23, 22, 29, 45, 26, 19, 51, 14, 24, 39, 28, 39, 18, 37, 57, 17, 38, 41, 15, 68, 32, 24, 66, 42, 10, 50, 27, 10, 53, 72, 25, 26 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS (a(n)-a(j))/(n-j) <> (a(j)-a(i))/(j-i) for all 0<=i(j-i)*(k-a(j)) od od; if ok then return k fi od end: seq(a(n), n=0..60); MATHEMATICA a[0] = a[1] = 0; a[n_] := a[n] = Module[{i, j, k, ok}, For[k = 0, True, k++, ok = True; For[j = n-1, ok && j >= 1, j--, For[i = j-1, ok && i >= 0, i--, ok = (n-j)*(a[j]-a[i]) != (j-i)*(k-a[j])]]; If[ok, Return[k]]]]; Table[a[n], {n, 0, 70}] (* Jean-François Alcover, Jun 16 2018, after Alois P. Heinz *) CROSSREFS Cf. A005836, A179040, A231334, A236335, A255708, A255709. Sequence in context: A199077 A345133 A016703 * A099289 A231892 A065628 Adjacent sequences: A236263 A236264 A236265 * A236267 A236268 A236269 KEYWORD nonn,look AUTHOR Alois P. Heinz, Jan 21 2014 STATUS approved

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.

Last modified December 7 21:25 EST 2022. Contains 358669 sequences. (Running on oeis4.)