Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071905
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1, 2, 3, 5, 7, 13, 29, 67, 103, 373 (list; graph; listen)
OFFSET

0,2

LINKS

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: A115261 A063792 A103600 this_sequence A067573 A103199 A054217

Adjacent sequences: A071902 A071903 A071904 this_sequence A071906 A071907 A071908

KEYWORD

hard,more,nice,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research