login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A071905
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
1, 2, 3, 5, 7, 13, 29, 67, 103, 373
OFFSET
0,2
EXAMPLE
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.
CROSSREFS
KEYWORD
hard,more,nice,nonn
AUTHOR
Koksal Karakus (karakusk(AT)hotmail.com), Jun 13 2002
STATUS
approved