login
a(n) is the smallest positive integer (which is a polynomial of degree 0) that cannot be obtained using the polynomials {x, x+1, ..., x+n} using each polynomial at most once and the operations +, -, *, /.
0

%I #4 Jul 10 2011 18:42:52

%S 1,2,3,5,7,13,29,67,103,373

%N a(n) is the smallest positive integer (which is a polynomial of degree 0) that cannot be obtained using the polynomials {x, x+1, ..., x+n} using each polynomial at most once and the operations +, -, *, /.

%H <a href="/index/Fo#4x4">Index entries for similar sequences</a>

%e a(3)=5 because using {x, x+1, x+2, x+3} we can get x+1-x=1, x+2-x=2, x+3-x=3, (x+2-x)*(x+3-(x+1))=4 but we cannot obtain 5 in the same way.

%Y Cf. A060315, A060316, A071110.

%K hard,more,nice,nonn

%O 0,2

%A Koksal Karakus (karakusk(AT)hotmail.com), Jun 13 2002