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

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

Table of n, a(n) for n=0..9.

Index entries for similar sequences

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

Cf. A060315, A060316, A071110.

Sequence in context: A272107 A227880 A167134 * A306317 A359483 A067573

Adjacent sequences: A071902 A071903 A071904 * A071906 A071907 A071908

KEYWORD

hard,more,nice,nonn

AUTHOR

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

STATUS

approved