|
|
A300002
|
|
Lexicographically earliest sequence of positive integers such that no k+2 points fall on any polynomial of degree k.
|
|
6
|
|
|
1, 2, 4, 3, 6, 5, 9, 16, 14, 20, 7, 15, 8, 12, 18, 31, 26, 27, 40, 30, 49, 38, 19, 10, 23, 53, 11, 32, 21, 25, 13, 47, 83
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) must avoid 2^(n-1)-1 polynomials: the polynomials defined by each nonempty subset of the first (n-1) terms of the sequence.
Conjecture: This sequence is a permutation of the natural numbers.
Sequence is also "Lexicographically earliest sequence of positive integers such that any k+1 points fall on a polynomial of degree k."
Conjecture: a(27)-a(32) are 11, 32, 21, 25, 13, 47. If all previous data are correct, no polynomial of degree ceiling(n/2.5) - 1 goes through any set of points. (End)
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) = 1.
a(2) != 1 or else (1, 1) and (2, 1) fall on y = 1. (Similarly all terms must be distinct.)
a(2) = 2.
a(3) != 1 or else (1, 1) and (3, 1) fall on y = 1.
a(3) != 2 or else (2, 2) and (3, 2) fall on y = 2.
a(3) != 3 or else (1, 1), (2, 2) and (3, 3) fall on y = x.
a(3) = 4.
a(4) != 1 or else (1, 1) and (4, 1) fall on y = 1.
a(4) != 2 or else (2, 2) and (4, 2) fall on y = 2.
a(4) = 3
|
|
MATHEMATICA
|
A = {{1, 1}, {2, 2}};
n = 3;
While[n < 50,
c = Sort[Select[Select[InterpolatingPolynomial[#, n] & /@ Subsets[A, {1, n - 1}], # > 0 & ] , IntegerQ]];
B = Differences[c];
If[Max[B] == 1,
d = Max[c] + 1,
d = Part[c, First[Position[B, Select[B, # > 1 &][[1]]]][[1]]] + 1];
A = Append[A, {n, d}];
Print[{n, d}]
n++;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more,nice,changed
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|