login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
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
Sequence in context: A272107 A227880 A167134 * A306317 A359483 A067573
KEYWORD
hard,more,nice,nonn
AUTHOR
Koksal Karakus (karakusk(AT)hotmail.com), Jun 13 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 13:53 EDT 2024. Contains 372387 sequences. (Running on oeis4.)