|
Search: id:A056697
|
|
|
| A056697 |
|
a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n. |
|
+0
1
|
|
| 2, 2, 2, 3, 4, 5, 29, 41, 55, 71, 791, 791, 1079, 1079, 1079, 30239, 246960, 246960, 636481, 636481, 1360800, 2162161, 2162161, 2162161, 39412801
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(9) = 55 because 55 gives remainder -1 when divided by 2,4,7 and 8 gives remainder 0 when divided by (1 and) 5, and gives remainder 1 when divided by 3,6, and 9. All smaller integers greater than 1 give remainders other than -1, 0, or 1 for at least one of 5,6,7,8, or 9
|
|
CROSSREFS
|
Adjacent sequences: A056694 A056695 A056696 this_sequence A056698 A056699 A056700
Sequence in context: A022869 A022865 A089150 this_sequence A132427 A098523 A048185
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Ted Alper (alper(AT)turing.stanford.edu), Aug 10 2000
|
|
|
Search completed in 0.002 seconds
|
