cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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 +, -, *, /.

This page as a plain text file.
%I A071905 #4 Jul 10 2011 18:42:52
%S A071905 1,2,3,5,7,13,29,67,103,373
%N 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 +, -, *, /.
%H A071905 <a href="/index/Fo#4x4">Index entries for similar sequences</a>
%e A071905 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 A071905 Cf. A060315, A060316, A071110.
%K A071905 hard,more,nice,nonn
%O A071905 0,2
%A A071905 Koksal Karakus (karakusk(AT)hotmail.com), Jun 13 2002